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 [20/02/2010 alle 11:57 (15 anni fa)] – Paolo Ferragina | biss2010:start [10/03/2010 alle 18:22 (15 anni fa)] (versione attuale) – Paolo Ferragina | ||
---|---|---|---|
Linea 10: | Linea 10: | ||
Every lecture will follow a problem-driven approach that starts from a real software-design problem, abstracts it in a combinatorial way (suitable for an algorithmic investigation), | Every lecture will follow a problem-driven approach that starts from a real software-design problem, abstracts it in a combinatorial way (suitable for an algorithmic investigation), | ||
- | |||
===== Lectures: topics and material ===== | ===== Lectures: topics and material ===== | ||
- | **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [slides, {{: | + | **Lecture 1.** Introduction to (Modern) Computational Models. Sorting vs Permuting. [{{: |
- | **Lecture 2.** Hashing: Uniform, Universal, Perfect, Cuckoo, Bloom Filters. [slides, {{: | + | **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 ===== | ||
The exam consists either in the solution of a bunch of exercises, or in the attack of one of the software project listed below. Each project can be conducted in team (no more than 3 students), and should be preferably close to the research interest of the candidate. | The exam consists either in the solution of a bunch of exercises, or in the attack of one of the software project listed below. Each project can be conducted in team (no more than 3 students), and should be preferably close to the research interest of the candidate. | ||
- | The students willing to give the exam should send me an [[mailto: | + | The students willing to give the exam should send me an [[mailto: |
- | + | ||
===== List of Projects ===== | ===== List of Projects ===== | ||
* Suggester for typing [inspiring papers? {{: | * Suggester for typing [inspiring papers? {{: | ||
* Problem posed by Chakrabharti [inspiring papers? {{: | * Problem posed by Chakrabharti [inspiring papers? {{: | ||
- | * Permuting Web pages to improve compression ratio [inspiring papers? {{: | + | * Permuting Web pages to improve compression ratio [inspiring papers? {{: |
- | * 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.1266667069.txt.gz · Ultima modifica: 20/02/2010 alle 11:57 (15 anni fa) da Paolo Ferragina