87 search results - page 17 / 18 » Approximate Nearest Neighbor Queries Revisited |
93
Voted
SODA
2012
ACM
12 years 12 months ago
2012
ACM
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
129
Voted
COMPGEOM
2010
ACM
15 years 2 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 ...
VLDB
2012
ACM
13 years 5 months ago
2012
ACM
In the last decade, spatio-temporal database research focuses on the design of effective and efficient indexing structures in support of location-based queries such as predictive...
124
click to vote
VLDB
1999
ACM
15 years 1 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
CIVR
2006
Springer
15 years 1 months ago
2006
Springer
High-dimensional index is one of the most challenging tasks for content-based video retrieval (CBVR). Typically, in video database, there exist two kinds of clues for query: visual...