154 search results - page 29 / 31 » Approximate String Matching: A Simpler Faster Algorithm |
PODS
2000
ACM
15 years 1 months ago
2000
ACM
In a variety of applications ranging from optimizing queries on alphanumeric attributes to providing approximate counts of documents containing several query terms, there is an in...
86
Voted
WWW
2005
ACM
15 years 10 months ago
2005
ACM
Web pages contain a combination of unique content and template material, which is present across multiple pages and used primarily for formatting, navigation, and branding. We stu...
126
Voted
CPM
2004
Springer
15 years 2 months ago
2004
Springer
We consider succinct, or highly space-efficient, representations of a (static) string consisting of n pairs of balanced parentheses, that support natural operations such as findi...
81
Voted
COMPGEOM
1995
ACM
15 years 1 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
ECCV
2006
Springer
15 years 11 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...