27 search results - page 1 / 6 » Supporting Subseries Nearest Neighbor Search via Approximati... |
CIKM
2000
Springer
13 years 9 months ago
2000
Springer
Ë Ö Ò ÓÖ Ò Ö ×Ø Ò ÓÖ× Ò Ð Ö × Ø Ó Ø Ñ × Ö × × Ò ÑÔÓÖØ ÒØ Ø Ñ Ò Ò Ø × º Ì × Ô Ô Ö ×ØÙ × Ø Óй ÐÓÛ Ò ØÝÔ Ó Ø Ñ × Ö ...
SDM
2012
SIAM
11 years 7 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
ICDE
2001
IEEE
14 years 6 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we show how the complexity of performing nearest neighbor (NNS) search on a metric space is related to the expansion of the metric space. Given a metric space we loo...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...