Strumenti Utente

Strumenti Sito


magistraleinformaticanetworking:ae:ae2011: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 revisioneRevisione precedente
Prossima revisione
Revisione precedente
magistraleinformaticanetworking:ae:ae2011:start [13/04/2012 alle 18:25 (13 anni fa)] – [List of Lectures] Paolo Ferraginamagistraleinformaticanetworking:ae:ae2011:start [15/10/2012 alle 09:32 (13 anni fa)] (versione attuale) – [Exam] Paolo Ferragina
Linea 30: Linea 30:
  
  
 +====== Exam ====== 
 +
 +
 +^ Dates ^ Room ^
 +| 08/06/2012 | {{:magistraleinformaticanetworking:ae:ae2011:ae120608.doc|Text}} |
 +| 28/06/2012 | {{:magistraleinformaticanetworking:ae:ae2011:ae120628.doc|Text}} |
 +| 23/07/2012 | {{:magistraleinformaticanetworking:ae:ae2011:ae120723.doc|Text}} |
 +| 03/09/2012 | {{:magistraleinformaticanetworking:ae:ae2011:ae120903.doc|Text}} |
 ====== Background======  ====== Background====== 
  
Linea 58: Linea 66:
 | 27/03/12 | Counting/Spectral Bloom filter. Hashing: hash table with chaining, issues in the use of simple hash functions, universal hashing - definition and examples. | | | 27/03/12 | Counting/Spectral Bloom filter. Hashing: hash table with chaining, issues in the use of simple hash functions, universal hashing - definition and examples. | |
 | 29/03/12 | Perfect hashing, cuckoo hashing, d-left hashing, min-ordered perfect hashing. | {{:magistraleinformaticanetworking:ae:ae2011:01._hashing.pptx|Slides}}, {{:magistraleinformaticanetworking:ae:ae2011:01_clr-hash.pdf|CLR chapter}}, {{:magistraleinformaticanetworking:ae:ae2011:01_appoggiomg-minordhash.pdf|part of WMB}} and {{:magistraleinformaticanetworking:ae:ae2011:01_cuckooundergrad.pdf|Cuckoo}}.| | 29/03/12 | Perfect hashing, cuckoo hashing, d-left hashing, min-ordered perfect hashing. | {{:magistraleinformaticanetworking:ae:ae2011:01._hashing.pptx|Slides}}, {{:magistraleinformaticanetworking:ae:ae2011:01_clr-hash.pdf|CLR chapter}}, {{:magistraleinformaticanetworking:ae:ae2011:01_appoggiomg-minordhash.pdf|part of WMB}} and {{:magistraleinformaticanetworking:ae:ae2011:01_cuckooundergrad.pdf|Cuckoo}}.|
-| 12/04/12 | Data Compression: entropy, prefix-free coding, Huffman coding with proof of optimality. | |+| 12/04/12 | Data Compression: entropy, prefix-free coding, Huffman coding with proof of optimality. | {{:magistraleinformaticanetworking:ae:ae2011:03_mg-compress.pdf|chapter of WMB}}, pag 21-41, 52-56, 74-79. | 
 +| 17/04/12 | Canonical Huffman, Arithmetic Coding | | 
 +| 19/04/12 | Integer Encoding: gamma, delta, Rice, Variable byte, (s,c)-dense codes, PForDelta | {{:magistraleinformaticanetworking:ae:ae2011:chap8.pdf|Chap 8}}, no "interpolative coding"
 +| 24/04/12 | Dictionary-based compressors: LZ77, gzip. An example of application: Rsync. Streaming compressors: MTF, RLE. | {{:magistraleinformaticanetworking:ae:ae2011:datacompression.pptx|Slides}} | 
 +| 26/04/12 | Burrows-Wheeler Transform and Bzip | | 
 +| 03/05/12 | Randomized data structures: Treaps | {{:magistraleinformaticanetworking:ae:ae2011:04_ericksonnotes-treap-sl.pdf|some notes}} | 
 +| 10/05/12 | Skip Lists | | 
 +| 15/05/12 | Exercises | | 
 +| 17/05/12 | Exercises | | 
 +| 22/05/12 | Exercises | | 
 +| 24/05/12 | Exercises | |
magistraleinformaticanetworking/ae/ae2011/start.1334341509.txt.gz · Ultima modifica: 13/04/2012 alle 18:25 (13 anni fa) da Paolo Ferragina

Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki