Strumenti Utente

Strumenti Sito


biss2010:start

Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

Link a questa pagina di confronto

Entrambe le parti precedenti la revisione Revisione precedente
Prossima revisione
Revisione precedente
biss2010:start [09/03/2010 alle 09:53 (14 anni fa)]
Paolo Ferragina
biss2010:start [10/03/2010 alle 18:22 (14 anni fa)] (versione attuale)
Paolo Ferragina
Linea 14: Linea 14:
 **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [{{:biss2010:ferragina-biss-day1.zip|slides}}, {{:biss2010:lect1-sorting.zip|material}}] **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [{{:biss2010:ferragina-biss-day1.zip|slides}}, {{:biss2010:lect1-sorting.zip|material}}]
  
-**Lecture 2.** Hashing: Uniform, Universal, Perfect, Cuckoo, Bloom Filters. [{{:biss2010:ferragina-biss-day.zip|slides}}, {{:biss2010:lect2-hash.zip|material}}]+**Lecture 2.** Hashing: Uniform, Universal, Perfect, Cuckoo. [{{:biss2010:ferragina-biss-day2a.zip|slides}}, {{:biss2010:lect2-hash.zip|material}}]
  
-**Lecture 3.** Dictionaries: From arrays to (Patricia) tries, from plain storage to (Locality Preserving) Front Coding. [slides, {{:biss2010:lect3-trie.zip|material}}]+**Lecture 3.** Dictionaries: From arrays to (Patricia) tries and Bloom Filters, from plain storage to (Locality Preserving) Front Coding. [{{:biss2010:ferragina-biss-day3.zip|slides}}, {{:biss2010:lect3-trie.zip|material}}]
  
-**Lecture 4.** Text indexing and mining: suffix trees and arrays. Some mining queries, and the issue "LCA=RMQ". [slides, {{:biss2010:lect4-suffixtreesuffixarray.zip|material}}]+**Lecture 4.** Text indexing and mining: suffix trees and arrays. Some mining queries, and the issue "LCA=RMQ". [{{:biss2010:ferragina-biss-day4.zip|slides}}, {{:biss2010:lect4-suffixtreesuffixarray.zip|material}}]
  
-**Lecture 5.** Data compression: basics, Huffman, Arithmetic, bzip2 and beyond. [slides, {{:biss2010:lect5-compression.zip|material}}]+**Lecture 5.** Data compression: basics, Huffman, Arithmetic, bzip2 and beyond. [{{:biss2010:ferragina-biss-day5.zip|slides}}, {{:biss2010:lect5-compression.zip|material}}]
  
 ===== Exam ===== ===== Exam =====
Linea 34: Linea 34:
   * Generalised BWT [inspiring papers? {{:biss2010:generalisedbwt.pdf|one}}, [[http://people.unipmn.it/manzini/bwtdisk/|sparring partner]], [[http://brie.di.unipi.it/_UKOriginal1Gb.warc.bz2|UK-crawl]],]   * Generalised BWT [inspiring papers? {{:biss2010:generalisedbwt.pdf|one}}, [[http://people.unipmn.it/manzini/bwtdisk/|sparring partner]], [[http://brie.di.unipi.it/_UKOriginal1Gb.warc.bz2|UK-crawl]],]
   * Temporal data mining on a DB of cars [ [[http://brie.di.unipi.it/autoscout24.tgz|dataset]] ]   * Temporal data mining on a DB of cars [ [[http://brie.di.unipi.it/autoscout24.tgz|dataset]] ]
-  * Smart compression: 
-      * Variable-block size depending on the number of phrases ({{:biss2010:lect3-lpfc.pdf|paper}}, [[http://www.zlib.net/|gzip]]) 
-      * Fix a bound on Compression-ratio, minimize the number of phrases (hence decompression time). 
-      * Fix a bound on Decompression-time, minimize the compression ratio. 
-  * Energy-aware algorithms: examples of inefficient algorithms which use less battery! 
  
-===== List of Students ===== 
  
-These are the students who attended the course: 
- 
-  - aa 
-  - aa 
-  -  
biss2010/start.1268128430.txt.gz · Ultima modifica: 09/03/2010 alle 09:53 (14 anni fa) da Paolo Ferragina