426 search results - page 46 / 86 » Run lengths and liquidity |
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
Suffix trees and suffix arrays are the most prominent full-text indices, and their construction algorithms are well studied. In the literature, the fastest algorithm runs in O(n...
SPIRE
2000
Springer
14 years 1 months ago
2000
Springer
We consider a fully compressed pattern matching problem, where both text T and pattern P are given by its succinct representation, in terms of straight-line programs and its varia...
TREC
2004
13 years 11 months ago
2004
In the experiment described in this paper, we investigate the effectiveness of a document-independent technique for eliciting additional information from searchers about their inf...
WSC
2000
13 years 11 months ago
2000
This paper is focused on estimating the quality of the sample mean from a steady-state simulation experiment with consideration of computational efficiency, memory requirement, an...
TCS
2008
13 years 9 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...