132 search results - page 14 / 27 » On Optimally Partitioning a Text to Improve Its Compression |
EDBT
2010
ACM
13 years 11 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Many scientific applications generate massive volumes of data through observations or computer simulations, bringing up the need for effective indexing methods for efficient stora...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
ACL
2007
13 years 10 months ago
2007
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The parser uses a representation for syntactic structur...
IJCAI
2003
13 years 9 months ago
2003
Unlike conventional data or text, Web pages typically contain a large amount of information that is not part of the main contents of the pages, e.g., banner ads, navigation bars, ...