87 search results - page 13 / 18 » Approximate Nearest Neighbor Queries Revisited |
ESA
2010
Springer
15 years 25 days ago
2010
Springer
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
119
click to vote
SIGMOD
2010
ACM
15 years 4 months ago
2010
ACM
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
SODA
2000
ACM
15 years 1 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...
93
Voted
SSDBM
2002
IEEE
15 years 4 months ago
2002
IEEE
An unordered labeled tree is a tree in which each node has a string label and the parent-child relationship is significant, but the order among siblings is unimportant. This pape...
105
click to vote
CVPR
2005
IEEE
16 years 1 months ago
2005
IEEE
Sets of local features that are invariant to common image transformations are an effective representation to use when comparing images; current methods typically judge feature set...