120 search results - page 6 / 24 » Complementary Hashing for Approximate Nearest Neighbor Searc... |
VLDB
1999
ACM
13 years 12 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
SODA
2000
ACM
13 years 9 months ago
2000
ACM
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...
CIKM
2000
Springer
14 years 5 hour ago
2000
Springer
Ë Ö Ò ÓÖ Ò Ö ×Ø Ò ÓÖ× Ò Ð Ö × Ø Ó Ø Ñ × Ö × × Ò ÑÔÓÖØ ÒØ Ø Ñ Ò Ò Ø × º Ì × Ô Ô Ö ×ØÙ × Ø Óй ÐÓÛ Ò ØÝÔ Ó Ø Ñ × Ö ...
SODA
1994
ACM
13 years 9 months ago
1994
ACM
NIPS
2007
13 years 9 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...