285 search results - page 41 / 57 » Approximate Nearest Neighbor Searching in Multimedia Databas... |
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. The estimation of the epipolar geometry is especially difficult where the putative correspondences include a low percentage of inlier correspondences and/or a large subse...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A new data structure for efficient similarity search in very large datasets of high-dimensional vectors is introduced. This structure called the inverted multi-index generalizes ...
AAAI
2012
11 years 10 months ago
2012
Hashing, which tries to learn similarity-preserving binary codes for data representation, has been widely used for efficient nearest neighbor search in massive databases due to i...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
The Internet contains billions of images, freely available online. Methods for efficiently searching this incredibly rich resource are vital for a large number of applications. Th...