
MIT 6.854 (Advanced Algorithms), Spring 2016
Dormant Last read · last published · next check
Read 3 days ago and current, but nothing has been published for 10 years.
Latest videos
Saves to your Watch queue, to pick up on another day or another device.


MIT 6.854 Spring 2016 Lecture 15: Gradient Descent

MIT 6.854 Spring 2016 Lecture 14: Rounding Linear Programming Relaxations

MIT 6.854 Spring 2016 Lecture 8: Capacity Scaling and Min Cost Matching

MIT 6.854 Spring 2016 Lecture 13: Submodular Functions

MIT 6.854 Spring 2016 Lecture 12: From Separation to Optimization and Back; Ellipsoid Method

MIT 6.854 Spring 2016 Lecture 10: Introduction to Linear Programming

MIT 6.854 Spring 2016 Lecture 11: Strong Duality, Zero Sum Games and Complementary Slackness

MIT 6.854 Spring 2016 Lecture 9: Min Cost Flow, Goldberg-Tarjan

MIT 6.854 Spring 2016 Lecture 7: Flow Decomposition and Augmenting Paths

MIT 6.854 Spring 2016 Lecture 6: Nearest Neighbor Search and LSH

MIT 6.854 Spring 2016 Lecture 3 part 2

MIT 6.854 Spring 2016 Lecture 5: Johnson Lindenstrauss Lemma and Extensions

MIT 6.854 Spring 2016 Lecture 4: Distinct Elements and Heavy Hitters

