26: Algorithmen II, Vorlesung, WS 2019/20, 28.01.2020
Description
26|
0:00:00 Start
0:02:19 The Document Retrieval Problem
0:03:30 Top-k Document Retrieval
0:04:39 Important Query Types
0:05:51 Inverted Indexes
0:09:13 Suffix Arrays
0:11:10 Warmup: Document Listing
0:14:24 Top-k Retrieval
0:15:21 Example
0:21:58 Example Space Usage from [LG17]
0:24:29 Range Minimum Query
0:25:12 2D-Weighted Range Queries
0:34:43 Range Minimum Query Problem
0:49:25 Comparison with other Implementations
0:50:41 (Hyper)Graph Partitioning
0:51:25 Graphs and Hypergraphs
0:54:48 Applications
0:57:08 Successful Heuristic: Multilevel Paradigm
1:09:41 Fiduccia-Mattheyses Algorithm
1:12:28 Adaptive Flow Iterations
1:13:57 Hypergraph Flow Network
1:16:56 Optimized Flow Problem Modeling Approach
1:19:22 Most Balanced Minimum Cut
1:21:10 Experiments: Connectivity Optimization
28|
0:00:00 Start
0:00:11 Externes binäres Mischen
0:13:06 8 Approximationsalgorithmen
0:26:45 9 Fixed-Parameter-Algorithmen
0:38:52 10 Parallele Algorithmen
0:52:22 11 Stringology
0:56:36 12 Geometrische Algorithmen
1:14:40 13 Onlinealgorithmen
Published 02/05/20
27|
0:00:00 Start
0:03:24 Fortgeschrittene Datenstrukturen
0:06:37 Pairing Heaps
0:15:49 Laufzeit im Durchschnitt
0:21:31 Bucket-Queue
0:37:07 Starke Zusammenhangskomponenten
0:44:05 Zusammenfassung: SCC Berechnung
0:53:28 Residual Graph
1:02:41 Randomisierte Algorithmen
Published 02/03/20