Introduction to Algorithms - Lecture 1: Algorithmic ...
Introduction to Algorithms - Lecture 1: Algorithmic Thinking, Peak Finding
Description: Overview of course content, including an motivating problem for each of the modules. The lecture then covers 1-D and 2-D peak finding, using this problem to point out some issues involved in designing efficient algorithms. Instructor: Srini Devadas
Introduction to Algorithms - Lecture 3: Insertion Sort, ...
Introduction to Algorithms - Lecture 3: Insertion Sort, Merge Sort
Description: Sorting is introduced, and motivated by problems that become easier once the inputs are sorted. The lecture covers insertion sort, then discusses merge sort and analyzes its running time using a recursion tree. Instructor: Srini Devadas
Introduction to Algorithms - Recitation 21: Dynamic ...
Introduction to Algorithms - Recitation 21: Dynamic Programming: Knapsack ...
Description: This recitation discusses the knapsack problem and polynomial time vs. pseudo-polynomial time. Instructor: Victor Costan
Introduction To MATLAB Programming - Lecture 3: Using Files
Introduction To MATLAB Programming - Lecture 3: Using Files
Description: This video lecture demonstrates how to create code in the editor and save it in a file to be used as a function or script. Examples include a script for the Fibonacci sequence and a function that converts Fahrenheit to Celsius. Instructor: Yossi Farjoun
The Film Experience - Lecture 15 (2007): Film in the 1970s, ...
The Film Experience - Lecture 15 (2007): Film in the 1970s, Part I
Note: This video is from the Fall 2007 class. This lecture discusses dramatic changes in American film of the late 60s and early 70s: the end of the studio era, social transformation, and television as the new consensus medium. Outline - Transformations and subversion ...
Health Information Systems to Improve Quality of Care in ...
Health Information Systems to Improve Quality of Care in Resource-Poor ...
Topic: A perspective on monitoring and evaluation, focusing on healthcare use. Instructor: Chaitali Sinha, International Development Research Centre (IDRC)
Introduction to Algorithms - Lecture 17: Bellman-Ford
Introduction to Algorithms - Lecture 17: Bellman-Ford
Description: This lecture reviews shortest path notation, considers a generic shortest path algorithm, and then describes and proves the Bellman-Ford algorithm, which can handle graphs with negative cycles. Instructor: Srini Devadas
Introduction to Algorithms - Recitation 14: Depth-First ...
Introduction to Algorithms - Recitation 14: Depth-First Search (DFS)
Description: This recitation covers depth-first search and DFS edge classification. Instructor: Victor Costan
Introduction to Algorithms - Recitation 7: Comparison Sort, ...
Introduction to Algorithms - Recitation 7: Comparison Sort, Counting and ...
Description: This recitation starts with a review of comparison sorting methods, and then discusses counting sort and radix sort. Instructor: Victor Costan
Health Information Systems to Improve Quality of Care in ...
Health Information Systems to Improve Quality of Care in Resource-Poor ...
Topic: Design and lead systems changes using "positive deviance." This approach identifies and promotes the positive outliers in a community, rather than directly focusing on fixing "what's wrong" in the community. Instructor: Jessica Haberer, Harvard Initiative for ...
Health Information Systems to Improve Quality of Care in ...
Health Information Systems to Improve Quality of Care in Resource-Poor ...
Topic: Evaluating and improving patient safety in resource-poor settings. Instructor: Pedro Delgado, Executive Director of Institute for Healthcare Improvement
Health Information Systems to Improve Quality of Care in ...
Health Information Systems to Improve Quality of Care in Resource-Poor ...
Topic: This lecture on process improvement theory and application introduces the PDSA (plan—do—study—act) model and describes its application in healthcare settings. Instructor: Brandon Bennett
Health Information Systems to Improve Quality of Care in ...
Health Information Systems to Improve Quality of Care in Resource-Poor ...
Topic: The World Health Organization Safe Surgery and Safe Childbirth Programs. Instructors: Alvin Kwok, Priya Agrawal (Harvard School of Public Health, WHO)
Introduction to Algorithms - Recitation 18: Quiz 2 Review
Introduction to Algorithms - Recitation 18: Quiz 2 Review
Description: This recitation reviews numerics and graphs in preparation for Quiz 2. Instructor: Victor Costan
Introduction to Algorithms - Recitation 19: Dynamic ...
Introduction to Algorithms - Recitation 19: Dynamic Programming: Crazy ...
Description: This recitation uses dynamic programming to find subsequences in the card game Crazy Eights, and to find the shortest path in a graph. Instructor: Victor Costan
Introduction to Algorithms - Lecture 24: Topics in ...
Introduction to Algorithms - Lecture 24: Topics in Algorithms Research
Description: In this lecture, both professors present areas of current research, including parallel processor architecture and algorithms, geometric folding algorithms, data structures, and graph algorithms. Instructor: Srini Devadas, Erik Demaine
Introduction to Algorithms - Recitation 13: Breadth-First ...
Introduction to Algorithms - Recitation 13: Breadth-First Search (BFS)
Description: This recitation starts with a discussion of Problem Set 5, and then covers graph representations and breadth-first search. Instructor: Victor Costan
Introduction to Algorithms - Recitation 15: Shortest Paths
Introduction to Algorithms - Recitation 15: Shortest Paths
Description: This recitation covers breadth-first search for shortest paths. Instructor: Victor Costan
Introduction to Algorithms - Recitation 16: Rubik's Cube, ...
Introduction to Algorithms - Recitation 16: Rubik's Cube, StarCraft Zero
Description: This recitation discusses the Rubik's cube problem from Problem Set 6, and then uses a graph model to find an optimal build order for a simplified version of the StarCraft game. Instructor: Victor Costan
Introduction to Algorithms - Lecture 6: AVL Trees, AVL Sort
Introduction to Algorithms - Lecture 6: AVL Trees, AVL Sort
Description: This lecture covers AVL trees, including how to insert elements and rebalance the tree, and then discusses the difference between abstract data types and data structures. Instructor: Erik Demaine