13 search results - page 1 / 3 » A Black Box for Online Approximate Pattern Matching |
CPM
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present a deterministic black box solution for online approximate matching. Given a pattern of length m and a streaming text of length n that arrives one character at ...
CPM
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. A black box method was recently given that solves the problem of online approximate matching for a class of problems whose distance functions can be classified as being ...
CORR
2010
Springer
12 years 11 months ago
2010
Springer
As more and more multi-tier services are developed from commercial off-the-shelf components or heterogeneous middleware without source code available, both developers and administr...
ICDAR
2003
IEEE
13 years 9 months ago
2003
IEEE
In this paper, we present a compressed pattern matching method for searching user queried words in the CCITT Group 4 compressed document images, without decompressing. The feature...
FUIN
2006
13 years 4 months ago
2006
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...