PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Farruggia A., Ferragina P., Frangioni A., Venturini R. Bicriteria data compression. In: SODA'14 - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (Portland, Oregon, US, 5-7 January 2014). Proceedings, pp. 1582 - 1595. ACM-SIAM, 2014.
 
 
Abstract
(English)
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.
URL: http://dl.acm.org/citation.cfm?id=2634189
Subject Data compression
Optimization
E.4 CODING AND INFORMATION THEORY


Icona documento 1) Download Document PDF
Icona documento 2) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional