Completed
Upper Bounding A Differences
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Randomized Composable Core-Sets for Submodular Maximization
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Outline
- 3 Processing Big Data
- 4 General Framework
- 5 Submodular Functions: example
- 6 Formal Definition of Composable Core-sets
- 7 Randomization Comes to Rescue
- 8 Importance of Robust Analysis
- 9 Family of B-nice Algorithms
- 10 Algorithm Greedy
- 11 Warm up: single machine greedy
- 12 Analysis of B-nice Algorithms
- 13 Upper Bounding A Differences
- 14 Remarks and Future work
