23 search results - page 1 / 5 » A Series of Run-Rich Strings |
LATA
2009
Springer
13 years 11 months ago
2009
Springer
We present a new series of run-rich strings, and give a new lower bound 0.94457567 of the maximum number of runs in a string. We also introduce the general conjecture about a asymp...
MST
2011
12 years 11 months ago
2011
The theory of two-dimensional languages, generalizing formal string languages, was motivated by problems arising from image processing and models of parallel computing. Weighted au...
TCS
2008
13 years 4 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...
TPDS
2008
13 years 4 months ago
2008
This paper presents Harmonic Ring (HRing), a structured peer-to-peer (P2P) overlay where long links are built along the ring with decreasing probabilities coinciding with the Harmo...
ALT
2004
Springer
14 years 1 months ago
2004
Springer
Finding a good pattern which discriminates one set of strings from the other set is a critical task in knowledge discovery. In this paper, we review a series of our works concernin...