magistraleinformaticanetworking:ae:ae2014: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:ae2014:start [19/05/2015 alle 11:01 (11 anni fa)] – Paolo Ferragina | magistraleinformaticanetworking:ae:ae2014:start [01/02/2016 alle 08:56 (10 anni fa)] (versione attuale) – [Exam] Paolo Ferragina | ||
|---|---|---|---|
| Linea 33: | Linea 33: | ||
| ^ Dates ^ Room ^ Testo ^ | ^ Dates ^ Room ^ Testo ^ | ||
| - | | 05-06-2015 | room L1, hr **** | text | | + | | 05-06-2015 | L1 | no participants |
| - | | 29-06-2015 | room L1, hr 9:00 | text | | + | | 29-06-2015 | L1 | {{:magistraleinformaticanetworking: |
| - | | 20-07-2015 | room L1, hr 9:00 | text | | + | | 20-07-2015 | L1 | {{: |
| + | | 10-09-2015 | L1 | {{: | ||
| + | | 11-01-2016 | L1 | {{: | ||
| + | | 01-02-2016 | L1 | {{: | ||
| Linea 68: | Linea 71: | ||
| | 23/03/2015 | Prefix search: definition of the problem, solution based on arrays, Front-coding, | | 23/03/2015 | Prefix search: definition of the problem, solution based on arrays, Front-coding, | ||
| | 24/03/2015 | More on two-level indexing of strings: review of in-memory level based on array of string pointers and uncompacted tries. Solution based on compacted trie and Patricia trie, with analysis of space, I/Os and time of the prefix search. | This year we don't study locality preserving FC. | | | 24/03/2015 | More on two-level indexing of strings: review of in-memory level based on array of string pointers and uncompacted tries. Solution based on compacted trie and Patricia trie, with analysis of space, I/Os and time of the prefix search. | This year we don't study locality preserving FC. | | ||
| - | | 25/03/2015 | Randomised data structures: Treaps and Skip lists (with proofs and comments on string items). | [[http:// | + | | 25/03/2015 | Randomised data structures: Treaps and Skip lists (with proofs and comments on string items). | [[http:// |
| | | //Students are warmly invited to refresh their know-how about:// hash functions and their properties; hashing with chaining. | Lectures 7 of Demaine-Leiserson' | | | //Students are warmly invited to refresh their know-how about:// hash functions and their properties; hashing with chaining. | Lectures 7 of Demaine-Leiserson' | ||
| | 26/03/2015 | Hashing and dictionary problem: direct addessing, simple hash functions, hashing with chaining, uniform hashing and its computing/ | | 26/03/2015 | Hashing and dictionary problem: direct addessing, simple hash functions, hashing with chaining, uniform hashing and its computing/ | ||
| Linea 90: | Linea 93: | ||
| | 12/05/2015 | Recap: graphs and their representations, | | 12/05/2015 | Recap: graphs and their representations, | ||
| | 18/05/2015 | Minimum Spanning Tree problem: definition, Greedy approach, Kruskal' | | 18/05/2015 | Minimum Spanning Tree problem: definition, Greedy approach, Kruskal' | ||
| - | | 19/05/2015 | Some considerations on external and semi-external | + | | 19/05/2015 | Algorithms for external and semi-external |
| - | | 25/ | + | | 25/05/2015 | Shortest Path problem: Dijkstra' |
| - | | 26/05/2015 | Room C, hr 11-13 | | | + | | 26/05/2015 | Exercises on Graph Problems | |
| - | ===== Topics to be dealt with, probably ===== | + | |
| - | + | ||
| - | + | ||
| - | | | + | |
| - | | | (Fully) external MST computation. Steiner Tree problem: definition and a 2-approximate solution. Traveling Salesman Tour problem: definition and a 2-approximate solution. | {{: | + | |
magistraleinformaticanetworking/ae/ae2014/start.1432033274.txt.gz · Ultima modifica: 19/05/2015 alle 11:01 (11 anni fa) da Paolo Ferragina