1885 search results - page 38 / 377 » Distance Map Retrieval |
121
click to vote
SIGIR
2010
ACM
15 years 6 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...
153
Voted
CVPR
2004
IEEE
16 years 4 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...
105
click to vote
CIVR
2006
Springer
15 years 6 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 ...
138
click to vote
INFOCOM
2011
IEEE
14 years 5 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...
116
click to vote
SIGIR
2008
ACM
15 years 2 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...