87 search results - page 7 / 18 » Approximate Nearest Neighbor Queries Revisited |
91
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
Spatial databases support a variety of geometric queries on point data such as range searches, nearest neighbor searches, etc. Balanced Aspect Ratio (BAR) trees are hierarchical sp...
111
Voted
SDM
2012
SIAM
12 years 12 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
STOC
2002
ACM
15 years 9 months ago
2002
ACM
Given a set S of n points in IRd , a (t, )-approximate Voronoi diagram (AVD) is a partition of space into constant complexity cells, where each cell c is associated with t represe...
96
Voted
ICALP
2004
Springer
15 years 2 months ago
2004
Springer
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
172
click to vote
SIGMOD
2009
ACM
15 years 9 months ago
2009
ACM
Nearest neighbor (NN) search in high dimensional space is an important problem in many applications. Ideally, a practical solution (i) should be implementable in a relational data...