132 search results - page 4 / 27 » On Optimally Partitioning a Text to Improve Its Compression |
IPM
2011
12 years 11 months ago
2011
In recent years, new semistatic word-based byte-oriented text compressors, such as Tagged Huffman and those based on Dense Codes, have shown that it is possible to perform fast d...
ESA
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
FSTTCS
2004
Springer
14 years 1 months ago
2004
Springer
Abstract Abstract. In this paper we improve the analysis of approximation algorithms based on semidefinite programming for the maximum graph partitioning problems MAX-k-CUT, MAX-k...
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper we present a new dictionary-based preprocessing technique and its implementation called TWRT (Two-level Word Replacing Transformation). Our preprocessor uses several...
ICIP
2008
IEEE
14 years 10 months ago
2008
IEEE
In this paper we present a new segmentation method for the Multidimensional Multiscale Parser (MMP) algorithm. In previous works we have shown that, for text and compound images, ...