Sciweavers

158 search results - page 4 / 32
» High dimensional reverse nearest neighbor queries
Sort
View
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
15 years 11 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
15 years 1 months ago
Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
We address the problem of designing data structures that allow efficient search for approximate nearest neighbors. More specifically, given a database consisting of a set of vecto...
Eyal Kushilevitz, Rafail Ostrovsky, Yuval Rabani
BTW
2007
Springer
183views Database» more  BTW 2007»
15 years 1 months ago
Efficient Reverse k-Nearest Neighbor Estimation
: The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, has received increasing a...
Elke Achtert, Christian Böhm, Peer Kröge...
IDEAS
2002
IEEE
148views Database» more  IDEAS 2002»
15 years 2 months ago
Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects
Rimantas Benetis, Christian S. Jensen, Gytis Karci...
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