Bicriteria data compression
Farruggia A., Frangioni A., Ferragina P., Venturini R.
Data compression Optimization E.4 CODING AND INFORMATION THEORY
In this paper we address the problem of trading optimally, and in a principled way, the compressed size/decompression time of LZSE{} parsings by introducing what we call the {em Bicriteria LZSE{}-Parsing problem}. The goal is to determine an LZ77 parsing which minimizes the space occupancy in bits of the compressed file, provided that the decompression time is bounded by T. Symmetrically, we can exchange the role of the two resources and thus ask for minimizing the decompression time provided that the compressed space is bounded by a fixed amount given in advance.
Source: SODA'14 - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1582–1595, Portland, Oregon, US, 5-7 January 2014
Back to previous page
@inproceedings{oai:it.cnr:prodotti:305211,
title = {Bicriteria data compression},
author = {Farruggia A. and Frangioni A. and Ferragina P. and Venturini R.},
booktitle = {SODA'14 - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1582–1595, Portland, Oregon, US, 5-7 January 2014},
year = {2014}
}
0000-0002-9830-3936