514 search results - page 21 / 103 » Approximate Periods of Strings |
SPIRE
2001
Springer
14 years 10 days ago
2001
Springer
We constructively prove the exact distribution of deletion sizes for unavoidable strings, under the reductive decidability method of Zimin and Bean et al. Bounds such as these on ...
ICDAR
2009
IEEE
13 years 5 months ago
2009
IEEE
Approximate text search is a basic technique to handle recognized text that contains recognition errors. This paper proposes an approximate string search for recognized text using...
CPM
2000
Springer
14 years 8 days ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
CIKM
1997
Springer
14 years 2 days ago
1997
Springer
As more online databases are integrated into digital libraries, the issue of quality control of the data becomes increasingly important, especially as it relates to the effective ...
CPM
1995
Springer
13 years 11 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...