52 search results - page 8 / 11 » Approximate nearest neighbors and the fast Johnson-Lindenstr... |
87
Voted
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
This paper improves recent methods for large scale image search. State-of-the-art methods build on the bag-of-features image representation. We, first, analyze bag-of-features in t...
CVPR
2005
IEEE
15 years 11 months ago
2005
IEEE
Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper, we combine th...
90
Voted
VISUALIZATION
1999
IEEE
15 years 1 months ago
1999
IEEE
Many applications produce three-dimensional points that must be further processed to generate a surface. Surface reconstruction algorithms that start with a set of unorganized poi...
102
click to vote
SIGMOD
2010
ACM
15 years 2 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...