122 search results - page 14 / 25 » Vector Algorithms for Approximate String Matching |
CSB
2005
IEEE
14 years 1 months ago
2005
IEEE
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
SODA
2010
ACM
13 years 6 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...
PAMI
2012
11 years 10 months ago
2012
—SIFT-like local feature descriptors are ubiquitously employed in such computer vision applications as content-based retrieval, video analysis, copy detection, object recognition...
SIGMOD
2008
ACM
14 years 8 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
ICAIL
2003
ACM
14 years 1 months ago
2003
ACM
Name matching—recognizing when two different strings are likely to denote the same entity—is an important task in many legal information systems, such as case-management syste...