Sciweavers

134 search results - page 6 / 27
» Approximate Nearest Neighbor Queries in Fixed Dimensions
Sort
View
GIS
2005
ACM
15 years 10 months ago
Two ellipse-based pruning methods for group nearest neighbor queries
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...
Hongga Li, Hua Lu, Bo Huang, Zhiyong Huang
FOCS
1999
IEEE
15 years 1 months ago
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recog...
Martin Farach-Colton, Piotr Indyk
WEA
2010
Springer
280views Algorithms» more  WEA 2010»
15 years 4 months ago
Practical Nearest Neighbor Search in the Plane
This paper shows that using some very simple practical assumptions, one can design an algorithm that finds the nearest neighbor of a given query point in O(log n) time in theory ...
Michael Connor, Piyush Kumar
SSDBM
2010
IEEE
127views Database» more  SSDBM 2010»
15 years 2 months ago
Optimizing All-Nearest-Neighbor Queries with Trigonometric Pruning
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,...
Tobias Emrich, Franz Graf, Hans-Peter Kriegel, Mat...
EDBT
2006
ACM
154views Database» more  EDBT 2006»
15 years 1 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl