Sciweavers

133 search results - page 5 / 27
» Approximate Nearest Subspace Search
Sort
View
ICCV
2011
IEEE
12 years 7 months ago
Complementary Hashing for Approximate Nearest Neighbor Search
Recently, hashing based Approximate Nearest Neighbor (ANN) techniques have been attracting lots of attention in computer vision. The data-dependent hashing methods, e.g., Spectral...
Hao Xu, Jingdong Wang, Zhu Li, Gang Zeng, Shipeng ...
FOCS
2004
IEEE
13 years 11 months ago
An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...
Amit Chakrabarti, Oded Regev
SODA
2000
ACM
132views Algorithms» more  SODA 2000»
13 years 9 months ago
Expected-case complexity of approximate nearest neighbor searching
Most research in algorithms for geometric query problems has focused on their worstcase performance. However, when information on the query distribution is available, the alternat...
Sunil Arya, Ho-Yam Addy Fu
CIKM
2000
Springer
13 years 12 months ago
Supporting Subseries Nearest Neighbor Search via Approximation
Ë Ö Ò ÓÖ Ò Ö ×Ø Ò ÓÖ× Ò Ð Ö × Ø Ó Ø Ñ × Ö × × Ò ÑÔÓÖØ ÒØ Ø Ñ Ò Ò Ø × º Ì × Ô Ô Ö ×ØÙ × Ø Óй ÐÓÛ Ò ØÝÔ Ó Ø Ñ × Ö ...
Changzhou Wang, Xiaoyang Sean Wang
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...