12: Algorithmen II, Vorlesung und Übung, WS 2018/19, 20.11.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Start
- 0:00:05 Randomisierte Algorithmen
- 0:00:23 Sortieren - Ergebnisüberprüfung (cheking)
- 0:03:23 Sort Cheking
- 0:10:42 Hashing
- 0:13:55 Here: Fast Space Efficient Hashing
- 0:15:44 Related Work
- 0:21:27 Cuckoo Hashing
- 0:25:55 Cuckoo Hashing - Rebuilds
- 0:35:29 Cuckoo Hashing - How many Rebuilds?
- 0:37:45 Random Graph Theory
- 0:41:12 Space Efficient Cuckoo Hashing
- 0:45:21 Zusammenfassung: Randomisierte Algorithmen
- 0:46:00 Ausblick: Randomisierte Algorithmen
- 0:46:47 Übung 5
- 0:46:56 Themenübersicht
- 0:48:36 Potentialmethode
- 0:53:52 Preflow-push Algorithmus
- 1:01:56 FIFO preflow-push Algorithmus
Duration (hh:mm:ss)
01:22:09
Series
Algorithmen II, Vorlesung, WS 2018/19
Published on
22.11.2018
Subject area
License
| Resolution | 1280 x 720 Pixel |
| Aspect ratio | 16:9 |
| Audio bitrate | 128000 bps |
| Audio channels | 2 |
| Audio Codec | aac |
| Audio Sample Rate | 48000 Hz |
| Total Bitrate | 935414 bps |
| Color Space | yuv420p |
| Container | mov,mp4,m4a,3gp,3g2,mj2 |
| Media Type | video/mp4 |
| Duration | 4929 s |
| Filename | DIVA-2018-873_hd.mp4 |
| File Size | 576.344.261 byte |
| Frame Rate | 25 |
| Video Bitrate | 801317 bps |
| Video Codec | h264 |
Media URL
Embed Code
Algorithmen II, Vorlesung, WS 2018/19
Episodes 1-30
of 30
