Sciweavers

9 search results - page 1 / 2
» Improving Semistatic Compression Via Pair-Based Coding
Sort
View
ERSHOV
2006
Springer
13 years 9 months ago
Improving Semistatic Compression Via Pair-Based Coding
In the last years, new semistatic word-based byte-oriented compressors, such as Plain and Tagged Huffman and the Dense Codes, have been used to improve the efficiency of text retri...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
IPM
2011
71views more  IPM 2011»
12 years 8 months ago
Improving semistatic compression via phrase-based modeling
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...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
IR
2007
13 years 5 months ago
Lightweight natural language text compression
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...
Nieves R. Brisaboa, Antonio Fariña, Gonzalo...
CGO
2003
IEEE
13 years 10 months ago
Code Optimization for Code Compression
With the emergence of software delivery platforms such as Microsoft’s .NET, reduced size of transmitted binaries has become a very important system parameter strongly affecting ...
Milenko Drinic, Darko Kirovski, Hoi Vo
TIT
2008
107views more  TIT 2008»
13 years 5 months ago
Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
The term binary combinatorial Gray code refers to a list of binary words such that the Hamming distance between two neighboring words is one and the list satisfies some additional ...
Igor Zinovik, Daniel Kroening, Yury Chebiryak