| S# |
Lecture |
Course |
Institute |
Instructor |
Discipline |
| 1601 |
Introduction to Human-Centered Artificial Intelligence (AI) (MIT)
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1602 |
Recurrent Neural Networks for Steering Through Time (MIT)
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1603 |
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1604 |
Intro to Machine Learning (in 360/VR) (MIT)
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1605 |
Introduction to Deep Learning and Self-Driving Cars (MIT)
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1606 |
Introduction to Deep Reinforcement Learning (Deep RL) (MIT)
|
Deep Learning (MIT)
|
MIT
|
Lex Fridman
|
Applied Sciences
|
| 1607 |
1. Course Overview, Interval Scheduling (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1608 |
10. Dynamic Programming: Advanced DP (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1609 |
11. Dynamic Programming: All-Pairs Shortest Paths (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1610 |
12. Greedy Algorithms: Minimum Spanning Tree (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1611 |
13. Incremental Improvement: Max Flow, Min Cut (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1612 |
14. Incremental Improvement: Matching (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1613 |
15. Linear Programming: LP, reductions, Simplex (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1614 |
16. Complexity: P, NP, NP-completeness, Reductions (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1615 |
R10. Distributed Algorithms (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1616 |
R11. Cryptography: More Primitives (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1617 |
17. Complexity: Approximation Algorithms (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1618 |
18. Complexity: Fixed-Parameter Algorithms (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1619 |
R2. 2-3 Trees and B-Trees (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1620 |
19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1621 |
R4. Randomized Select and Randomized Quicksort (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1622 |
2. Divide & Conquer: Convex Hull, Median Finding (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1623 |
R5. Dynamic Programming (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1624 |
20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
| 1625 |
R6. Greedy Algorithms (M-I-T)
|
Design and Analysis of Algorithms (M-I-T)
|
MIT
|
Prof. Dr. Erik Demaine, Prof. Dr. Srini Devadas, Prof. Dr. Nancy Lynch
|
Applied Sciences
|
