106 search results - page 6 / 22 » Fast Approximate Point Set Matching for Information Retrieva... |
DAS
2008
Springer
13 years 9 months ago
2008
Springer
In this paper we present an adaptive method for graphic symbol representation based on shape contexts. The proposed descriptor is invariant under classical geometric transforms (r...
ECCV
2010
Springer
14 years 21 days ago
2010
Springer
Approximate Nearest Neighbor (ANN) methods such as Locality Sensitive Hashing, Semantic Hashing, and Spectral Hashing, provide computationally ecient procedures for nding objects...
ISBI
2004
IEEE
14 years 8 months ago
2004
IEEE
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
SIGMOD
2010
ACM
14 years 9 days ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...