Differenze

Queste sono le differenze tra la revisione selezionata e la versione attuale della pagina.

--- digitalhealth:ad2da2024:start [09/07/2024 alle 15:29 (19 mesi fa)] – Paolo Ferragina
+++ digitalhealth:ad2da2024:start [11/09/2024 alle 13:06 (16 mesi fa)] (versione attuale) – [Lectures (TO BE CHANGED SIGNIFICANTLY)] Paolo Ferragina
@@ Linea 9: / Linea 9: @@
 **Language:** English.
-**Question time:** Monday: 15-17, or by appointment (also in video-conferencing through the [[|virtual room]] of the course)
+**Question time:** Monday: 15-17, or by appointment (also in video-conferencing through the [[https://teams.microsoft.com/l/channel/19%3AO9q8qIxe1smcUr3YbVZI9kI3unDQJ7qv4nOkoymbcy41%40thread.tacv2/General?groupId=65581510-815c-49a3-8c9f-ab8ebf19087d|virtual room]] of the course)
-**News:** about this course will be distributed via a [[ | Telegram channel]].
+**News:** about this course will be distributed via a [[https://t.me/+pS8ExdytXdMwOGI0| Telegram channel]].
 **Official lectures schedule:** The schedule and content of the lectures are available below and with the [[https://unimap.unipi.it/registri/dettregistriNEW.php?re=::::&ri=9142|official registro]].
@@ Linea 65: / Linea 65: @@
 I strongly suggest refreshing your knowledge about basic Algorithms and Data Structures by looking at the well-known book [[https://mitpress.mit.edu/books/introduction-algorithms-third-edition|Introduction to Algorithms]], Cormen-Leiserson-Rivest-Stein (third edition). Specifically, I suggest you look at the chapters 2, 3, 4, 6, 7, 8, 10, 11 (no perfect hash), 12 (no randomly built), 15 (no optimal BST), 18, 22 (no strongly connected components). Also, you could look at the [[http://videolectures.net/mit6046jf05_introduction_algorithms/|Video Lectures]] by Erik Demaine and Charles Leiserson, specifically Lectures 1-7, 9-10, and 15-17.
-The content of the course will be mainly covered by the book published by //Cambridge University Press// as [https://www.cambridge.org/core/books/pearls-of-algorithm-engineering/95061352D7263CCCBD4F243018236EB2|Pearls of Algorithm Engineering].
+The content of the course will be covered in part by the book published by //Cambridge University Press// as [https://www.cambridge.org/core/books/pearls-of-algorithm-engineering/95061352D7263CCCBD4F243018236EB2|Pearls of Algorithm Engineering], and in part by notes and GitHub refs that will provide the materials of hands-on sessions.
@@ Linea 76: / Linea 76: @@
 ^ Date ^ Lecture ^ Biblio ^
 |  | Key issues about I/Os, streaming, and hierarchical memory in managing massive datasets. |  |
 |  | Algorithmic and data structure issues concerning atomic versus variable-length items. |  |
-|  | Two fundamental tools: sorting and permitting. |  |
+|  | Two fundamental tools: sorting and permuting. |  |
 |  | Key-value stores: From basic to advanced hash tables and tries. |  |
 |  | Textual search engines: compressing and accessing posting lists (integer sequences) and text collections. Deduplicating similar/equal texts, clustering text collections. |  |