1632 search results - page 225 / 327 » Sublinear Time Algorithms for Metric Space Problems |
117
click to vote
ICTAI
2000
IEEE
15 years 8 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...
130
Voted
EDBT
2008
ACM
16 years 3 months ago
2008
ACM
Enterprises may have multiple database systems spread across the organization for redundancy or for serving different applications. In such systems, query workloads can be distrib...
144
click to vote
SIAMCOMP
2002
15 years 3 months ago
2002
Let us consider an ordered vector A[1 : n]. If the cost of testing each position is similar, then the standard binary search is the best strategy to search the vector. This is true...
187
click to vote
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
128
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
We study the problem of computing the free space F of a simple legged robot called the spider robot. The body of this robot is a single point and the legs are attached to the body....