lecture linear
The 30 most recent episodes and tracks on this topic.
Saves to your Watch queue, to pick up on another day or another device.
Pick anything below and it plays in the bar at the foot of the window — and keeps playing while you go on browsing the directory.
- A Second Course in Algorithms (Lecture 15: Introduction to Approximation Algorithms)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 14: Online Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 13: Online Scheduling and Online Steiner Tree)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 12: Applications of Multiplicative Weights to Games and LPs)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 11: Online Learning and the Multiplicative Weights Algorithm)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 9: Linear Programming Duality --- Part 2)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorirthms (Lecture 8: Linear Programming Duality --- Part 1)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 7: Linear Programming: Introduction and Applications)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 4: Applications of Maximum Flows and Minimum Cuts)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 3: The Push-Relabel Algorithm for Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 2: Augmenting Path Algorithms for Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- A Second Course in Algorithms (Lecture 1: Course Goals and Introduction to Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
- Lecture 01 - The Learning ProblemMachine Learning Course - CS 156Notes
- Lecture 15 - Kernel MethodsMachine Learning Course - CS 156Notes
- Lecture 14 - Support Vector MachinesMachine Learning Course - CS 156Notes
- Lecture 13 - ValidationMachine Learning Course - CS 156Notes
- Lecture 12 - RegularizationMachine Learning Course - CS 156Notes
- Lecture 11 - OverfittingMachine Learning Course - CS 156Notes
- Lecture 10 - Neural NetworksMachine Learning Course - CS 156Notes
- Lecture 09 - The Linear Model IIMachine Learning Course - CS 156Notes
- Lecture 08 - Bias-Variance TradeoffMachine Learning Course - CS 156Notes
- Lecture 07 - The VC DimensionMachine Learning Course - CS 156Notes
- Lecture 06 - Theory of GeneralizationMachine Learning Course - CS 156Notes
- Lecture 05 - Training Versus TestingMachine Learning Course - CS 156Notes
- Lecture 04 - Error and NoiseMachine Learning Course - CS 156Notes
- Lecture 03 -The Linear Model IMachine Learning Course - CS 156Notes
- Lecture 02 - Is Learning Feasible?Machine Learning Course - CS 156Notes
This playlist:.m3u.plsAll the feeds behind it
