1885 search results - page 38 / 377 » Distance Map Retrieval |
100
Voted
SIGIR
2010
ACM
15 years 3 months ago
2010
ACM
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
127
click to vote
CVPR
2004
IEEE
16 years 1 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
CIVR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. Video databases require that clips are represented in a compact and discriminative way, in order to perform efficient matching and retrieval of documents of interest. We ...
112
click to vote
INFOCOM
2011
IEEE
14 years 3 months ago
2011
IEEE
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
Efficient similarity search in high-dimensional spaces is important to content-based retrieval systems. Recent studies have shown that sketches can effectively approximate L1 dist...