58 search results - page 5 / 12 » Sublinear Time Algorithms for Earth Mover's Distance |
ECCV
2008
Springer
14 years 10 months ago
2008
Springer
We present a new metric between histograms such as SIFT descriptors and a linear time algorithm for its computation. It is common practice to use the L2 metric for comparing SIFT d...
SODA
2010
ACM
13 years 7 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
SSDBM
2010
IEEE
14 years 1 months ago
2010
IEEE
With the growing focus on semantic searches and interpretations, an increasing number of standardized vocabularies and ontologies are being designed and used to describe data. We ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
ECCV
2006
Springer
14 years 10 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...