Bicriteria data compression (Contributo in atti di convegno)

Type
Label
  • Bicriteria data compression (Contributo in atti di convegno) (literal)
Anno
  • 2014-01-01T00:00:00+01:00 (literal)
Alternative label
  • Farruggia A., Frangioni A., Ferragina P., Venturini R. (2014)
    Bicriteria data compression
    in SODA'14 - Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, Portland, Oregon, US, 5-7 January 2014
    (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori
  • Farruggia A., Frangioni A., Ferragina P., Venturini R. (literal)
Pagina inizio
  • 1582 (literal)
Pagina fine
  • 1595 (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#url
  • http://dl.acm.org/citation.cfm?id=2634189 (literal)
Note
  • Scopu (literal)
  • PuMa (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni
  • Department of Computer Science, University of Pisa, Italy; Department of Computer Science, University of Pisa, Italy; Department of Computer Science, University of Pisa, Italy; CNR-ISTI, Pisa, Italy (literal)
Titolo
  • Bicriteria data compression (literal)
Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#isbn
  • 978-1-611973-38-9 (literal)
Abstract
  • 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. (literal)
Prodotto di
Autore CNR
Insieme di parole chiave

Incoming links:


Prodotto
Autore CNR di
Insieme di parole chiave di
data.CNR.it