1038 search results - page 71 / 208 » Space-Bounded Query Approximation |
114
Voted
CCCG
2008
15 years 4 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
137
Voted
NIPS
2004
15 years 3 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
110
Voted
CIKM
2003
Springer
15 years 7 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
126
click to vote
FOCS
2009
IEEE
15 years 9 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...
166
Voted
COMGEO
2002
ACM
15 years 2 months ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...