26: Algorithmen II, Vorlesung, WS 2019/20, 28.01.2020
An episode of the Algorithmen 2, Vorlesung, WS19/20 podcast, hosted by Prof. Dr. Peter Sanders, titled "26: Algorithmen II, Vorlesung, WS 2019/20, 28.01.2020" was published on February 3, 2020 and runs 83 minutes.
February 3, 2020 ·83m · Algorithmen 2, Vorlesung, WS19/20
Summary
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
Episode Description
Similar Episodes
Feb 7, 2019 ·86m
Feb 4, 2019 ·82m
Jan 31, 2019 ·70m
Jan 29, 2019 ·86m
Jan 24, 2019 ·85m
Jan 22, 2019 ·85m