1272 search results - page 37 / 255 » Approximate Parameterized Matching |
130
click to vote
PR
1998
15 years 3 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
134
click to vote
STACS
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. We study the maximum weight matching problem in the semi-streaming model, and improve on the currently best one-pass algorithm due to Zelke (Proc. STACS '08, pages 6...
68
Voted
ICPR
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper, we propose an algorithm to resample coarse vector fields in order to obtain vector fields of a higher density. Unlike the typical linear interpolation scheme, our a...
106
Voted
STOC
2007
ACM
16 years 3 months ago
2007
ACM
184
click to vote
CPM
1998
Springer
15 years 7 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...