52 search results - page 5 / 11 » Approximate nearest neighbors and the fast Johnson-Lindenstr... |
111
click to vote
CVPR
2004
IEEE
15 years 11 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...
AMR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. This article explores the feasibility of a market-ready, mobile pattern recognition system based on the latest findings in the field of object recognition and currently a...
103
click to vote
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Hashing based Approximate Nearest Neighbor (ANN) search has attracted much attention due to its fast query time and drastically reduced storage. However, most of the hashing metho...
RECOMB
2003
Springer
15 years 9 months ago
2003
Springer
It is shown that structural similarity between proteins can be decided well with much less information than what is used in common similarity measures. The full C representation c...
91
Voted
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
We present a near linear time algorithm for constructing hierarchical nets in finite metric spaces with constant doubling dimension. This data-structure is then applied to obtain...