733 search results - page 1 / 147 » An Optimal Algorithm for Approximate Nearest Neighbor Search... |
54
Voted
SODA
1994
ACM
15 years 1 months ago
1994
ACM
133
click to vote
TIP
2002
14 years 12 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...
111
Voted
SODA
2000
ACM
15 years 1 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...
161
Voted
CORR
1999
Springer
15 years 13 hour ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
130
Voted
ICASSP
2010
IEEE
15 years 16 days ago
2010
IEEE
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...