214 search results - page 27 / 43 » Fast Nearest Neighbor Search in High-Dimensional Space |
78
Voted
CVPR
2008
IEEE
15 years 11 months ago
2008
IEEE
We introduce a method that enables scalable image search for learned metrics. Given pairwise similarity and dissimilarity constraints between some images, we learn a Mahalanobis d...
103
click to vote
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
93
Voted
SISAP
2009
IEEE
15 years 4 months ago
2009
IEEE
—We present an overview of the combinatorial framework for similarity search. An algorithm is combinatorial if only direct comparisons between two pairwise similarity values are ...
KDD
2009
ACM
15 years 10 months ago
2009
ACM
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
COMPGEOM
2006
ACM
15 years 3 months ago
2006
ACM
Given a metric space (X, dX), c ≥ 1, r > 0, and p, q ∈ [0, 1], a distribution over mappings H : X → N is called a (r, cr, p, q)-sensitive hash family if any two points in...