1262 search results - page 84 / 253 » Fast Robust Hashing |
164
click to vote
ECCV
2006
Springer
16 years 8 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
210
click to vote
ACSC
2007
IEEE
16 years 16 days ago
2007
IEEE
Tries are the fastest tree-based data structures for managing strings in-memory, but are space-intensive. The burst-trie is almost as fast but reduces space by collapsing trie-cha...
186
click to vote
ICMCS
2007
IEEE
16 years 15 days ago
2007
IEEE
One key challenge in content-based image retrieval (CBIR) is to develop a fast solution for indexing high-dimensional image contents, which is crucial to building large-scale CBIR...
139
click to vote
NIPS
2007
15 years 7 months ago
2007
Can we leverage learning techniques to build a fast nearest-neighbor (ANN) retrieval data structure? We present a general learning framework for the NN problem in which sample que...
144
click to vote
ICA
2007
Springer
16 years 10 days ago
2007
Springer
FastICA is arguably one of the most widespread methods for independent component analysis. We focus on its deflation-based implementation, where the independent components are ext...