MIT OpenCourseWare
5,896 vídeos, +2,320,000 suscriptores



tiempovistas
R10. Distributed Algorithms50:190
23. Cache-Oblivious Algorithms: Medians & Matrices57:570
R6. Greedy Algorithms22:240
Engaging Students0:540
Meet the Educator3:100
R2. 2-3 Trees and B-Trees30:450
14. Incremental Improvement: Matching1:22:330
18. Complexity: Fixed-Parameter Algorithms1:17:430
2. Divide & Conquer: Convex Hull, Median Finding1:20:350
7. Randomization: Skip Lists1:20:560
24. Cache-Oblivious Algorithms: Searching & Sorting1:17:410
On the Challenge of Assessing Students' Abiliites to Apply Algorithms in New and Creative Ways2:370
On Teaching Complex Content3:430
Co-Teaching the Course2:180
1. Emergence of Gravity1:31:110
11. String Theory in the Light-cone Gauge1:22:180
19. Mass-dimension Relation1:52:600
16. Geometry of D-branes and AdS / CFT Conjecture1:49:300
24. Holographic Entanglement Entropy1:56:320
21. Euclidean Correlation Functions: Higher-point Functions1:20:300
13. Physics of D-branes, Part I1:23:580
4. Physical Interpretation of Black Hole Temperature1:28:440
6. Holographic Principle1:26:500
7. Structure of Large N Expansion1:23:900
20. Euclidean Correlation Functions: Two-point Functions1:22:430
22. Computation of the Wilson Loop1:50:490
15. Physics of D-branes, Part III1:24:100
3. Causal Structure of a Black Hole and Black Hole Temperature1:22:400
5. Black Hole Thermodynamics1:19:450
8. Large N Expansion as a String Theory, Part I1:29:450
14. Physics of D-branes, Part II1:52:270
23. Duality at a Finite Temperature and Finite Chemical Potential1:25:550
9. Large N Expansion as a String Theory, Part II1:53:100
12. String Spectrum and Graviton1:44:570
17. More on AdS / CFT Duality1:48:700
10. Basics of String Theory and Light-cone Gauge1:42:250
2. Classical Black Hole Geometry1:18:220
18. General Aspects of the Duality1:24:580
Day 1: Identity and Genre; Part 11:28:500es en una lista
Day 10: Project Time; Part 2: Rough Cuts51:270es en una lista
Day 2: STEM Nuggets; Part 242:800es en una lista
Day 3: Storyteller’s Toolkit Pt. I: Verbal Storytelling/Writing for the Spoken Word; Part 226:700es en una lista
Day 6: Table-Read / Office Hours2:14:190es en una lista
Day 1: Identity and Genre; Part 320:130es en una lista
Day 5: Storyteller’s Toolkit Pt. III: Visual Storytelling & Realizing Vision; Part 239:210es en una lista
Day 5: Storyteller’s Toolkit Pt. III: Visual Storytelling & Realizing Vision; Part 339:360es en una lista
Day 3: Storyteller’s Toolkit Pt. I: Verbal Storytelling/Writing for the Spoken Word; Part 12:11:470es en una lista
Day 11: Screening (Rough Cuts)1:43:500es en una lista
Student Interview: Nathan Hernandez and Andrea Desrosiers3:220es en una lista
Student Interview: Kenneth Cheah1:550es en una lista
Day 7: Table Read / Post-Production; Part 2: Post-Production1:44:600es en una lista
Day 5: Storyteller’s Toolkit Pt. III: Visual Storytelling & Realizing Vision; Part 117:400es en una lista
Day 4: Storyteller’s Toolkit Pt. II: Visual Storytelling; Part 2: Storyboarding1:28:270es en una lista
Day 13: Screening (Final Cuts)1:07:160es en una lista
Day 7: Table-read / Post-production; Part 1: Table-read42:500es en una lista
Day 2: STEM Nuggets; Part 358:420es en una lista
Student Interview: Paul (PJ) Folino3:100es en una lista
Student Interview: Yuliya Klochan1:470es en una lista
OCW Educator: Sharing teaching approaches and materials from MIT with educators everywhere, for free2:290
5. Amortization: Amortized Analysis1:15:530
R8. NP-Complete Problems45:470
11. Dynamic Programming: All-Pairs Shortest Paths1:21:490
R5. Dynamic Programming52:300
19. Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees1:17:340
17. Complexity: Approximation Algorithms1:21:800
R1. Matrix Multiplication and the Master Theorem53:460
9. Augmentation: Range Trees1:24:340
8. Randomization: Universal & Perfect Hashing1:21:510
R4. Randomized Select and Randomized Quicksort39:300
R7. Network Flow and Matching51:120
6. Randomization: Matrix Multiply, Quicksort1:21:520
R11. Cryptography: More Primitives49:300
20. Asynchronous Distributed Algorithms: Shortest-Paths Spanning Trees1:12:300
16. Complexity: P, NP, NP-completeness, Reductions1:25:250
Teaching Reflection: Day 62:270es en una lista
Teaching Reflection: Day 42:560es en una lista
Teaching Reflection: Day 21:460es en una lista
Teaching Reflection: Day 12:410es en una lista
Teaching Reflection: Day 112:480es en una lista
Day 5: Storyteller’s Toolkit Pt. III: Visual Storytelling & Realizing Vision; Part 42:340es en una lista
Day 2: STEM Nuggets; Part 136:600es en una lista
Teaching Reflection: Day 33:320es en una lista
Teaching Reflection: Day 52:300es en una lista
Teaching Reflection: Day 7 & 83:360es en una lista
Instructor Interview: Inspiration for the Course and Intended Learning Outcomes7:460es en una lista
Instructor Interview: Workshops9:540es en una lista
Day 10: Project Time; Part 1: Animation35:800es en una lista
Day 4: Storyteller’s Toolkit Pt. II: Visual Storytelling; Part 1: Animation27:400es en una lista
Day 1: Identity and Genre; Part 236:450es en una lista
Instructor Interview: A Class on Pre-Production4:490es en una lista
Student Interview: Joshua Cheong1:470es en una lista
Instructor Interview: Digital Media Literacy5:460es en una lista
Instructor Interview: Teaching as a Team4:580es en una lista
Instructor Interview: Assessment and Feedback in Creative Contexts15:570es en una lista
Interview with Lara Baladi1:53:300es en una lista
Gamification & Us: Promises and Challenges of a Gameful World1:47:500es en una lista
Instructor Interview: Teaching Heritage Learners in a Streamlined Language Course5:350es en una lista
評量學生的語言學習 / 评量学生的语言学习3:110es en una lista
Instructor Interview: Meet the Instructor1:140es en una lista
Instructor Interview: Philosophical Approach to Language Teaching9:510es en una lista



Página principal - Acerca de - Agregar su canal.
Compartir en :

[Versión móvil] [https://www.facebook.com/listubes]
Listubes, Copyright 2024