MIT

Videos: 91 Likes: 71,126 Views: 12,432,199

Videos by: MIT

23. Cache-Oblivious Algorithms: Medians & Matrices

23. Cache-Oblivious Algorithms: Medians & Matrices

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine introduces cache-oblivious algorithms. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
16. Complexity: P, NP, NP-completeness, Reductions

16. Complexity: P, NP, NP-completeness, Reductions

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine introduces NP-completeness. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu
18. Complexity: Fixed-Parameter Algorithms

18. Complexity: Fixed-Parameter Algorithms

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine tackles NP-hard problems using fixed-parameter algorithms. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

12a: Neural Nets

2 years ago
*NOTE: These videos were recorded in Fall 2015 to update the Neural Nets portion of the class. MIT 6.034 Artificial Intelligence, Fall 2010 View the complete course: ocw.mit.edu/6-034F10 Instructor: Patrick Winston In this video, Prof. Winston introduces neural nets and back propagation. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

12b: Deep Neural Nets

2 years ago
*NOTE: These videos were recorded in Fall 2015 to update the Neural Nets portion of the class. MIT 6.034 Artificial Intelligence, Fall 2010 View the complete course: ocw.mit.edu/6-034F10 Instructor: Patrick Winston In this lecture, Prof. Winston discusses BLANK and modern breakthroughs in neural net research. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses […]

5. Amortization: Amortized Analysis

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine introduces analysis techniques for data structures, and the implementation of algorithms based on this analysis. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Nancy Ann Lynch In this lecture, Professor Lynch introduces synchronous distributed algorithms. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

11. Dynamic Programming: All-Pairs Shortest Paths

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine covers different algorithmic solutions for the All-Pairs Shortest Paths problem. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

R5. Dynamic Programming

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Ling Ren In this recitation, problems related to dynamic programming are discussed. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

17. Complexity: Approximation Algorithms

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Srinivas Devadas In this lecture, Professor Devadas introduces approximation algorithms in the context of NP-hard problems. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

R8. NP-Complete Problems

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Amartya Shankha Biswas In this recitation, problems related to NP-Completeness are discussed. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu

9. Augmentation: Range Trees

2 years ago
MIT 6.046J Design and Analysis of Algorithms, Spring 2015 View the complete course: ocw.mit.edu/6-046JS15 Instructor: Erik Demaine In this lecture, Professor Demaine covers the augmentation of data structures, updating common structures to store additional information. License: Creative Commons BY-NC-SA More information at ocw.mit.edu/terms More courses at ocw.mit.edu