122 search results - page 13 / 25 » Vector Algorithms for Approximate String Matching |
ICML
2008
IEEE
14 years 8 months ago
2008
IEEE
We have developed a new Linear Support Vector Machine (SVM) training algorithm called OCAS. Its computational effort scales linearly with the sample size. In an extensive empirica...
FUN
2010
Springer
14 years 21 days ago
2010
Springer
Given a string s, the Parikh vector of s, denoted p(s), counts the multiplicity of each character in s. Searching for a match of Parikh vector q (a “jumbled string”) in the tex...
LATIN
1998
Springer
14 years 3 days ago
1998
Springer
We address the problem of approximate string matching in two dimensions, that is, to nd a pattern of size m m in a text of size n n with at most k errors (substitutions, insertions...
SIAMCOMP
1998
13 years 7 months ago
1998
Abstract. String matching is rich with a variety of algorithmic tools. In contrast, multidimensional matching has had a rather sparse set of techniques. This paper presents a new a...
DIS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We propose a new string kernel based on variable-lengthdon't-care patterns (VLDC patterns). A VLDC pattern is an element of ({}) , where is an alphabet and is the ...