93 search results - page 4 / 19 » Fast Searching on Compressed Text Allowing Errors |
IR
2007
13 years 7 months ago
2007
Variants of Huffman codes where words are taken as the source symbols are currently the most attractive choices to compress natural language text databases. In particular, Tagged...
DCC
2003
IEEE
14 years 7 months ago
2003
IEEE
In this paper we introduce StarZip, a multi-corpora lossless text compression utility which incorporates StarNT, our newly proposed transform algorithm. StarNT is a dictionary-base...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Following the joint source and channel coding paradigm, we propose in this article an application controlling strategy to allow fast adaptation of multimedia transmission to the i...
CPM
2000
Springer
13 years 11 months ago
2000
Springer
We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect...
DCC
2010
IEEE
13 years 10 months ago
2010
IEEE
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...