magistraleinformatica:ir:ir14: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 | ||
magistraleinformatica:ir:ir14:start [08/06/2015 alle 08:28 (9 anni fa)] – [Exam] Paolo Ferragina | magistraleinformatica:ir:ir14:start [15/09/2015 alle 10:59 (9 anni fa)] (versione attuale) – [General Information] Paolo Ferragina | ||
---|---|---|---|
Linea 8: | Linea 8: | ||
* **Lectures Schedule:** tuesday 14-16 (N1), thursday 14-16 (C) | * **Lectures Schedule:** tuesday 14-16 (N1), thursday 14-16 (C) | ||
* **Question time:** by appointment. | * **Question time:** by appointment. | ||
- | * **Official Lecture' | + | * **Official Lecture' |
* News about this course will be distributed via a [[http:// | * News about this course will be distributed via a [[http:// | ||
Linea 26: | Linea 26: | ||
^ Date ^ Room ^ Text ^ | ^ Date ^ Room ^ Text ^ | ||
- | | 16-01-15, 09:00 | C1 | {{: | + | | 16-01-2015 | C1 | {{: |
- | | 09-02-15, 09:00 | A1 | {{: | + | | 09-02-2015 | A1 | {{: |
- | | 05-06-2015, 09:00 | L1 | {{: | + | | 05-06-2015 | L1 | {{: |
- | | 29-06-2015 | room L1, hr 9:00 | text | | + | | 29-06-2015 | L1 | {{:magistraleinformatica: |
- | | 20-07-2015 | room L1, hr 9:00 | text | | + | | 20-07-2015 | L1 | {{:magistraleinformatica: |
+ | | 10-09-2015 | L1 | {{: | ||
===== Books ===== | ===== Books ===== | ||
Linea 51: | Linea 52: | ||
| 30-10-2014 | PForDelta. Rank and Select primitives: definition and their use. Elias-Fano code and its use for postings compression. | {{: | | 30-10-2014 | PForDelta. Rank and Select primitives: definition and their use. Elias-Fano code and its use for postings compression. | {{: | ||
| 11-11-2014 | More on Rank and Select on binary arrays. Rank and Select on general arrays: the Wavelet Tree. Binary tree encoding and navigation. | {{: | | 11-11-2014 | More on Rank and Select on binary arrays. Rank and Select on general arrays: the Wavelet Tree. Binary tree encoding and navigation. | {{: | ||
- | | 13-11-2014 | Suffix arrays: data structure and search operations. Text mining over suffix arrays. Move-to-Front and Run-length-encoding and Burrows-Wheeler Transform: bzip, how to construct, | + | | 13-11-2014 | Suffix arrays: data structure and search operations. Text mining over suffix arrays. Move-to-Front and Run-length-encoding and Burrows-Wheeler Transform: bzip, how to construct, |
| 18-11-2014 | Text-based ranking: dice, jaccard, tf-idf. Vector space model. Storage of tf-idf and use for computing document-query similarity. Fast top-k retrieval: high idf, champion lists, many query-terms, | | 18-11-2014 | Text-based ranking: dice, jaccard, tf-idf. Vector space model. Storage of tf-idf and use for computing document-query similarity. Fast top-k retrieval: high idf, champion lists, many query-terms, | ||
- | | 25-11-2014 | Link-based ranking: pagerank and HITS and weighted variants. | Chap 21 from [MRS]. {{: | + | | 25-11-2014 | Link-based ranking: pagerank and HITS and weighted variants. | Chap 21 from [MRS]. {{: |
| 27-11-2014 | Web search engines: difficulties for their design, the web-graph and its properties, how to compute the SCC I/ | | 27-11-2014 | Web search engines: difficulties for their design, the web-graph and its properties, how to compute the SCC I/ | ||
| 28-11-2014 | The storage of the web graph. Latent Semantic Indexing. | Chap 18 and 20.4 from [MRS]. {{: | | 28-11-2014 | The storage of the web graph. Latent Semantic Indexing. | Chap 18 and 20.4 from [MRS]. {{: |
magistraleinformatica/ir/ir14/start.1433752085.txt.gz · Ultima modifica: 08/06/2015 alle 08:28 (9 anni fa) da Paolo Ferragina