biss2010:start
Differenze
Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.
| Entrambe le parti precedenti la revisioneRevisione precedenteProssima revisione | Revisione precedente | ||
| biss2010:start [09/03/2010 alle 16:14 (16 anni fa)] – Paolo Ferragina | biss2010:start [10/03/2010 alle 18:22 (16 anni fa)] (versione attuale) – Paolo Ferragina | ||
|---|---|---|---|
| Linea 14: | Linea 14: | ||
| **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [{{: | **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [{{: | ||
| - | **Lecture 2.** Hashing: Uniform, Universal, Perfect, Cuckoo, Bloom Filters. [{{: | + | **Lecture 2.** Hashing: Uniform, Universal, Perfect, Cuckoo. [{{: |
| - | **Lecture 3.** Dictionaries: | + | **Lecture 3.** Dictionaries: |
| - | **Lecture 4.** Text indexing and mining: suffix trees and arrays. Some mining queries, and the issue " | + | **Lecture 4.** Text indexing and mining: suffix trees and arrays. Some mining queries, and the issue " |
| - | **Lecture 5.** Data compression: | + | **Lecture 5.** Data compression: |
| ===== Exam ===== | ===== Exam ===== | ||
| Linea 34: | Linea 34: | ||
| * Generalised BWT [inspiring papers? {{: | * Generalised BWT [inspiring papers? {{: | ||
| * Temporal data mining on a DB of cars [ [[http:// | * Temporal data mining on a DB of cars [ [[http:// | ||
| - | * Smart compression: | ||
| - | * Variable-block size depending on the number of phrases ({{: | ||
| - | * Fix a bound on Compression-ratio, | ||
| - | * Fix a bound on Decompression-time, | ||
| - | * 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.1268151240.txt.gz · Ultima modifica: 09/03/2010 alle 16:14 (16 anni fa) da Paolo Ferragina
