229 search results - page 20 / 46 » Semi-Lossless Text Compression |
133
Voted
DCC
2007
IEEE
16 years 5 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 ...
151
Voted
DCC
2005
IEEE
16 years 5 months ago
2005
IEEE
165
Voted
CPM
2001
Springer
15 years 10 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...
157
click to vote
COMPSAC
2002
IEEE
15 years 10 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...