52 search results - page 2 / 11 » Approximate nearest neighbors and the fast Johnson-Lindenstr... |
120
Voted
JGTOOLS
2006
14 years 11 months ago
2006
We present a graphics hardware implementation of the tangent-plane algorithm for computing the kth-order Voronoi diagram of a set of point sites in image space. Correct and effici...
130
click to vote
SDM
2012
SIAM
13 years 2 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...
126
click to vote
TIP
2002
14 years 11 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
83
Voted
ICASSP
2010
IEEE
14 years 11 months ago
2010
IEEE
A new method is introduced that makes use of sparse image representations to search for approximate nearest neighbors (ANN) under the normalized inner-product distance. The approa...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We present an algorithm for the c-approximate nearest neighbor problem in a d-dimensional Euclidean space, achieving query time of O(dn1/c2 +o(1) ) and space O(dn + n1+1/c2 +o(1) ...