magistraleinformaticanetworking:ae:ae2023: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 | ||
| magistraleinformaticanetworking:ae:ae2023:start [21/11/2023 alle 09:52 (16 mesi fa)] – [Lectures] Paolo Ferragina | magistraleinformaticanetworking:ae:ae2023:start [02/09/2024 alle 21:00 (6 mesi fa)] (versione attuale) – [Exam] Paolo Ferragina | ||
|---|---|---|---|
| Linea 42: | Linea 42: | ||
| ^ Dates ^ Room ^ Text ^ Notes ^ | ^ Dates ^ Room ^ Text ^ Notes ^ | ||
| | 06/11/2023, start at 14:00 | room E | Mid term: [[https:// | | 06/11/2023, start at 14:00 | room E | Mid term: [[https:// | ||
| - | | 00/12/2023, start at 00:00 | room 00 | Final term: solution, | + | | 12/12/2023, start at 09:30 | room C | Final term: {{ : |
| - | | 00/01/2024, start at 00:00 | room 00 | Exam: solution, | + | | 15/01/2024, start at 9:00 | room C1 | Exam: {{ : |
| - | | 00/02/2024, start at 00:00 | room 00 | Exam: solution, text, results | + | | 09/02/2024, start at 00:00 | room 00 | Exam: {{ : |
| + | | 27/05/2024, start at 11:00 | room C | {{ : | ||
| + | | 21/06/2024, start at 11:00 | room C | {{ : | ||
| + | | 11/07/2024, start at 11:00 | room C | {{ : | ||
| + | | 04/09/2024, start at 09:00 | room C | text | | | ||
| ====== Background and Notes of the Course ====== | ====== Background and Notes of the Course ====== | ||
| Linea 55: | Linea 60: | ||
| ====== Lectures ====== | ====== Lectures ====== | ||
| - | [[https:// | + | [[https:// |
| The lectures below include also some **EXTRA** material, which is suggested to be read for students aiming to high rankings. | The lectures below include also some **EXTRA** material, which is suggested to be read for students aiming to high rankings. | ||
| Linea 93: | Linea 98: | ||
| | 21/11/2023 | Rank and Select: definition and succinct solution for Rank. Two theorems: one for a compact solution and one for a compressed solution based on Elias-Fano. \\ **EXTRA:** Solution for Select.| Chap. 15 of the book | | | 21/11/2023 | Rank and Select: definition and succinct solution for Rank. Two theorems: one for a compact solution and one for a compressed solution based on Elias-Fano. \\ **EXTRA:** Solution for Select.| Chap. 15 of the book | | ||
| | 22/11/2023 | Succinctly encoding of binary trees, and labeled binary trees, with examples. | | | | 22/11/2023 | Succinctly encoding of binary trees, and labeled binary trees, with examples. | | | ||
| - | + | | 27/11/2023 | Data Compression. Static, semistatic, and dynamic models for frequency estimation. Huffman, with optimality (proof) and relation to Entropy. Canonical Huffman: construction, | |
| - | + | | 27/11/2023 | Arithmetic coding: properties, the converter tool. Compression, | |
| - | | 00/00/0000 | Data Compression. Static, semistatic and dynamic models for frequency estimation. Huffman, with optimality (proof) and relation to Entropy | Chap. 120 of the book. No PPM. | | + | | 28/11/2023 | Exercises |
| - | | 00/00/0000 | Canonical Huffman: construction, | + | | 04/12/2023 | Dictionary-based compressors: |
| - | | 00/00/0000 | More on Arithmetic coding: compression, | + | | 05/12/2023 | Compressor bzip: MTF, RLE0, Wheeler-code, |
| - | | 00/00/0000 | Dictionary-based compressors: | + | | 06/12/2023 | Exercises | |
| - | | 00/00/0000 | Compressor bzip: MTF, RLE0, Wheeler-code, | + | | 11/12/2023 | Exercises | | |
| - | | 00/00/0000 | Exercises | | | + | | 12/12/2023 | **FINAL TERM exam in room C, 9:30-11** | Please register in the ESAMI platform, on the exam date of January.| |
magistraleinformaticanetworking/ae/ae2023/start.1700560331.txt.gz · Ultima modifica: 21/11/2023 alle 09:52 (16 mesi fa) da Paolo Ferragina