229 search results - page 20 / 46 » Semi-Lossless Text Compression |
102
Voted
DCC
2007
IEEE
16 years 2 months ago
2007
IEEE
We consider grammar based text compression with longest first substitution, where non-overlapping occurrences of a longest repeating substring of the input text are replaced by a ...
109
Voted
DCC
2005
IEEE
16 years 2 months ago
2005
IEEE
89
Voted
DCC
2002
IEEE
16 years 2 months ago
2002
IEEE
122
click to vote
CPM
2001
Springer
15 years 7 months ago
2001
Springer
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
123
Voted
COMPSAC
2002
IEEE
15 years 7 months ago
2002
IEEE
Compressed pattern matching refers to the process of, given a text in a compressed form and a pattern, finding all the occurrences of the pattern in the text without decompressio...