RSS Amplifier

Topic · lecture linear

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.

  1. A Second Course in Algorithms (Lecture 15: Introduction to Approximation Algorithms)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  2. A Second Course in Algorithms (Lecture 14: Online Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  3. A Second Course in Algorithms (Lecture 13: Online Scheduling and Online Steiner Tree)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  4. 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
  5. A Second Course in Algorithms (Lecture 11: Online Learning and the Multiplicative Weights Algorithm)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  6. A Second Course in Algorithms (Lecture 10: The Minimax Theorem & Algorithms for Linear Programming)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  7. A Second Course in Algorithms (Lecture 9: Linear Programming Duality --- Part 2)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  8. A Second Course in Algorirthms (Lecture 8: Linear Programming Duality --- Part 1)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  9. A Second Course in Algorithms (Lecture 7: Linear Programming: Introduction and Applications)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  10. A Second Course in Algorithms (Lecture 6: Generalizations of Maximum Flow and Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  11. A Second Course in Algorithms (Lecture 5: Minimum-Cost Bipartite Matching)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  12. A Second Course in Algorithms (Lecture 4: Applications of Maximum Flows and Minimum Cuts)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  13. A Second Course in Algorithms (Lecture 3: The Push-Relabel Algorithm for Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  14. A Second Course in Algorithms (Lecture 2: Augmenting Path Algorithms for Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  15. A Second Course in Algorithms (Lecture 1: Course Goals and Introduction to Maximum Flow)A Second Course in Algorithms (Stanford CS261, Winter 2016)Notes
  16. Lecture 01 - The Learning ProblemMachine Learning Course - CS 156Notes
  17. Lecture 15 - Kernel MethodsMachine Learning Course - CS 156Notes
  18. Lecture 14 - Support Vector MachinesMachine Learning Course - CS 156Notes
  19. Lecture 13 - ValidationMachine Learning Course - CS 156Notes
  20. Lecture 12 - RegularizationMachine Learning Course - CS 156Notes
  21. Lecture 11 - OverfittingMachine Learning Course - CS 156Notes
  22. Lecture 10 - Neural NetworksMachine Learning Course - CS 156Notes
  23. Lecture 09 - The Linear Model IIMachine Learning Course - CS 156Notes
  24. Lecture 08 - Bias-Variance TradeoffMachine Learning Course - CS 156Notes
  25. Lecture 07 - The VC DimensionMachine Learning Course - CS 156Notes
  26. Lecture 06 - Theory of GeneralizationMachine Learning Course - CS 156Notes
  27. Lecture 05 - Training Versus TestingMachine Learning Course - CS 156Notes
  28. Lecture 04 - Error and NoiseMachine Learning Course - CS 156Notes
  29. Lecture 03 -The Linear Model IMachine Learning Course - CS 156Notes
  30. Lecture 02 - Is Learning Feasible?Machine Learning Course - CS 156Notes