169 search results - page 14 / 34 » Pattern Matching in Text Compressed by Using Antidictionarie... |
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We present a new index for approximate string matching. The index collects text q-samples, that is, disjoint text substrings of length q, at fixed intervals and stores their posi...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
JUCS
2000
13 years 7 months ago
2000
This article introduces the idea that information compression by multiple alignment, unification and search (ICMAUS) provides a framework within which natural language syntax may ...
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
ICAPR
2009
Springer
14 years 2 days ago
2009
Springer
—A representation based on the phase of analytic image is proposed to address the issue of illumination variation in face recognition task. The problem of unwrapping in the compu...