336 search results - page 3 / 68 » Compression of Samplable Sources |
116
Voted
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Recently, the existence of considerable amount of redundancy in the Internet traffic has stimulated the deployment of several redundancy elimination techniques within the netwo...
95
Voted
IPM
2011
14 years 3 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...
85
Voted
DCC
2010
IEEE
15 years 6 months ago
2010
IEEE
Motivated by the Markov chain Monte Carlo (MCMC) relaxation method of Jalali and Weissman, we propose a lossy compression algorithm for continuous amplitude sources that relies on...
83
Voted
DCC
2009
IEEE
16 years 7 days ago
2009
IEEE
Rapid development of DNA sequencing technologies exponentially increases the amount of publicly available genomic data. Whole genome multiple sequence alignments represent a parti...
COCO
2004
Springer
15 years 5 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...