Sciweavers

280 search results - page 7 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
ICDE
2012
IEEE
343views Database» more  ICDE 2012»
13 years 1 days ago
Bi-level Locality Sensitive Hashing for k-Nearest Neighbor Computation
We present a new Bi-level LSH algorithm to perform approximate k-nearest neighbor search in high dimensional spaces. Our formulation is based on a two-level scheme. In the first ...
Jia Pan, Dinesh Manocha
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
12 years 12 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
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...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
ICALP
2004
Springer
15 years 3 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
CIVR
2008
Springer
204views Image Analysis» more  CIVR 2008»
14 years 11 months ago
Image clustering based on a shared nearest neighbors approach for tagged collections
Browsing and finding pictures in large-scale and heterogeneous collections is an important issue, most particularly for online photo sharing applications. Since such services know...
Pierre-Alain Moëllic, Jean-Emmanuel Haugeard,...
CIKM
2003
Springer
15 years 2 months ago
High dimensional reverse nearest neighbor queries
Reverse Nearest Neighbor (RNN) queries are of particular interest in a wide range of applications such as decision support systems, profile based marketing, data streaming, docum...
Amit Singh, Hakan Ferhatosmanoglu, Ali Saman Tosun