Titlebook: SWAT ‘88; 1st Scandinavian Wor Rolf Karlsson,Andrzej Lingas Conference proceedings 1988 Springer-Verlag Berlin Heidelberg 1988 Algorithms.R

Tyler

書(shū)目名稱SWAT ‘88影響因子(影響力)




書(shū)目名稱SWAT ‘88影響因子(影響力)學(xué)科排名




書(shū)目名稱SWAT ‘88網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱SWAT ‘88網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱SWAT ‘88被引頻次




書(shū)目名稱SWAT ‘88被引頻次學(xué)科排名




書(shū)目名稱SWAT ‘88年度引用




書(shū)目名稱SWAT ‘88年度引用學(xué)科排名




書(shū)目名稱SWAT ‘88讀者反饋




書(shū)目名稱SWAT ‘88讀者反饋學(xué)科排名

construct

A lower bound and two approximative algorithms for the K-partitioning of rectilinear polygons, algorithms for the .-partitioning problem are presented. Their time complexities are O(. log..) or O(..log .), depending on the properties of the given .-gon. In most cases, both algorithms find .-partitions with no more than 2.(.) components.

daredevil

Connectability problems,ing these problems in a general framework might lead to general solutions. Some solutions are presented. In particular, an .(. log .loglog .) solution is given for determining all pairs of points in a set that can be connected with an axis-parallel rectangle, avoiding a set of obstacle points.

現(xiàn)實(shí)

名字的誤用

Parallel solution of sparse linear systems,of .. The algorithm has two stages. First is a graph-theoretic structure prediction phase, which runs in time .(log..). There follows a numerical computation phase, which runs in time proportional to the height of the elimination tree of . times a log factor.

Misgiving

syring

種植,培養(yǎng)

商店街

An extrapolation on the interpolation search, found in less than 10 accesses on the average, without using any knowledge of the distribution..There are two basic ideas that accomplish this improvement. One is to allow extrapolation over small intervals, and the other is to use the least-square method to approximate the first probe position in the table.

epicardium