Sciweavers

151 search results - page 5 / 31
» Expected-case complexity of approximate nearest neighbor sea...
Sort
View
PAMI
2011
13 years 2 months ago
Approximate Nearest Subspace Search
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
STOC
1998
ACM
190views Algorithms» more  STOC 1998»
13 years 12 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
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 11 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
SODA
1994
ACM
85views Algorithms» more  SODA 1994»
13 years 9 months ago
An Optimal Algorithm for Approximate Nearest Neighbor Searching
Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...
CIKM
2000
Springer
14 years 1 days ago
Supporting Subseries Nearest Neighbor Search via Approximation
Ë Ö Ò ÓÖ Ò Ö ×Ø Ò ÓÖ× Ò Ð Ö × Ø Ó Ø Ñ × Ö × × Ò ÑÔÓÖØ ÒØ Ø Ñ Ò Ò Ø × º Ì × Ô Ô Ö ×ØÙ × Ø Óй ÐÓÛ Ò ØÝÔ Ó Ø Ñ × Ö ...
Changzhou Wang, Xiaoyang Sean Wang