13 search results - page 2 / 3 » A Black Box for Online Approximate Pattern Matching |
CPM
2008
Springer
13 years 6 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
RSA
2002
13 years 4 months ago
2002
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
JDA
2011
12 years 12 months ago
2011
It has recently been shown how to construct online, non-amortised approximate pattern matching algorithms for a class of problems whose distance functions can be classified as be...
ACCV
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be a...
IISWC
2008
IEEE
13 years 11 months ago
2008
IEEE
Commercial server applications remain memory bound on modern multiprocessor systems because of their large data footprints, frequent sharing, complex non-strided access patterns, ...