87 search results - page 3 / 18 » Approximate Nearest Neighbor Queries Revisited |
168
Voted
GIS
2005
ACM
15 years 10 months ago
2005
ACM
Group nearest neighbor (GNN) queries are a relatively new type of operations in spatial database applications. Different from a traditional kNN query which specifies a single quer...
138
click to vote
CORR
1999
Springer
14 years 9 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
CCCG
2008
14 years 11 months ago
2008
We present the first spatially adaptive data structure that answers approximate nearest neighbor (ANN) queries to points that reside in a geometric space of any constant dimension...
75
Voted
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...
68
Voted
SSDBM
2010
IEEE
15 years 2 months ago
2010
IEEE
Many applications require to determine the k-nearest neighbors for multiple query points simultaneously. This task is known as all-(k)-nearest-neighbor (AkNN) query. In this paper,...