• Non ci sono risultati.

On the use of optimization techniques for designing novel data compression and indexing schemes

N/A
N/A
Protected

Academic year: 2021

Condividi "On the use of optimization techniques for designing novel data compression and indexing schemes"

Copied!
1
0
0

Testo completo

(1)

Relazione sulle attivit`

a svolte durante il dottorato

Andrea Farruggia

La mia tesi si `e concentrata sullo studio delle tecniche di ottimizzazione per lo sviluppo di algoritmi di compressione ed indici compressi. Su questo argomento ho pubblicato i seguenti articoli (in ordine di pubblicazione):

1. Bicriteria Data Compression, ACM-SIAM SODA14 [2];

2. Bicriteria Data Compression: Efficient and Usable, ESA14 [3];

3. RLZAP: Relative Lempel-Ziv with Adaptive Pointers, SPIRE16 [1].

Durante il mio dottorato ho inoltre speso i seguenti periodi all’estero: • MADALGO (Aarhus University), Visiting PhD student

• Yahoo! Labs, London

• University of Helsinki, Visiting PhD student ed ho sostenuto le seguenti attivit`a formative:

• Seminari :

– Mauriana Pesaresi Lunchtime Seminars;

– ciclo di seminari PhD+ sullo spirito imprenditoriale, la difesa della propriet`a intellettuale e la creazione d’impresa;

– algoritmi per la bioinformatica; • Corsi :

– Foundations of Security, prof. Joshua Guttman;

– Stochastic Process Algebras for Quantitative Analysis, prof. Jane Hillston;

– Shape and Visual Apperance Acquisition for Photo-realistic Visualization, dott. Fabio Gano-velli e Massimiliano Corsini;

– Iterative rounding, prof. Fabrizio Grandoni.

– Bayesian machine learning, prof. Guido Sanguinetti.

– Fragments of Structural and Algorithmic Graph Theory, prof. Martin Milaniˇc. – Logic, Sets and Graphs: prof. Alberto Policriti;

– Algoritmi per la bioinformatica: prof. Nadia Pisanti;

Infine, la versione a rivista del paper Bicriteria Data Compression (coautori: Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, Rossano Venturini), che unisce ed espande i contributi in [2, 3], `e stato sottoposto al SIAM Journal of Computing.

Riferimenti bibliografici

[1] Anthony J. Cox, Andrea Farruggia, Travis Gagie, Simon J. Puglisi, and Jouni Sir´en. RLZAP: relative lempel-ziv with adaptive pointers. In String Processing and Information Retrieval - 23rd International Symposium, SPIRE 2016, Beppu, Japan, October 18-20, 2016, Proceedings, pages 1–14, 2016.

[2] Andrea Farruggia, Paolo Ferragina, Antonio Frangioni, and Rossano Venturini. Bicriteria data com-pression. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1582–1595, 2014.

[3] Andrea Farruggia, Paolo Ferragina, and Rossano Venturini. Bicriteria data compression: Efficient and usable. In Proceedings of the 22th European Symposia on Algorithms (ESA), pages 406–417, 2014.

Riferimenti

Documenti correlati

Self-adaptive systems need to be designed with respect to threats within their operating conditions. Identifying such threats dur- ing the design phase can benefit from the

Comparison between the thermal conductivity of a-Si computed for a 1728-atom supercell by the classical Green–Kubo theory of linear response using either our QHGK approach (Eq.. ( 3

In fact it does not map symbol -> bits uniquely, as Huffman, but the mapping may actually change and, moreover, it uses fractions of bits.. Idea

Since both an insertion or a deletion inside an aligned phrase can be expressed either with an adaptive pointer (encoded in DeltaBits bits) or with a literal run (whose length

Hence, to afford sampling at lower rates than the Nyquist rate and still recovering the exact signal, we cannot rely on the sampling theorem and it is in this sense that CS opens up

L’obiettivo di questa tesi è presentare nuove tecniche relative alla compressione ed alla protezione di dati multidimensionali (come ad esempio, immagini mediche

The main objective of this thesis is to explore and discuss novel techniques related to the compression and protection of multidimensional data (i.e., 3-D

 Throw the dictionary away when it reaches a certain size (used in GIF).  Throw the dictionary away when it is no longer effective at compressing