Introduction to Algorithms - Lecture 21: Dynamic ...
Introduction to Algorithms - Lecture 21: Dynamic Programming III: ...
Description: This lecture starts with how to define useful subproblems for strings or sequences, and then looks at parenthesization, edit distance, and the knapsack problem. The lecture ends with a brief discussion of pseudopolynomial time. Instructor: Erik Demaine
Introduction to Algorithms - Lecture 10: Open Addressing, ...
Introduction to Algorithms - Lecture 10: Open Addressing, Cryptographic ...
Description: This lecture covers open addressing, which is another approach to dealing with collisions (hashing with chaining was covered in Lecture 8). Cryptographic hashing is also introduced. Instructor: Srini Devadas
Introduction to Algorithms - Lecture 14: Depth-First Search ...
Introduction to Algorithms - Lecture 14: Depth-First Search (DFS), ...
Description: This lecture covers depth-first search, including edge classification, and how DFS is used for cycle detection and topological sort. Instructor: Erik Demaine
Introduction to Algorithms - Lecture 15: Single-Source ...
Introduction to Algorithms - Lecture 15: Single-Source Shortest Paths ...
Description: This lecture introduces weighted graphs and considers general approaches to the shortest paths problem. The lecture discusses single source shortest paths, negative-weight edges, and optimal substructure. Instructor: Srini Devadas
Introduction to Algorithms - Lecture 19: Dynamic ...
Introduction to Algorithms - Lecture 19: Dynamic Programming I: Fibonacci, ...
Description: This lecture introduces dynamic programming, in which careful exhaustive search can be used to design polynomial-time algorithms. The Fibonacci and shortest paths problems are used to introduce guessing, memoization, and reusing solutions to subproblems. ...
Introduction to Algorithms - Recitation 10: Quiz 1 Review
Introduction to Algorithms - Recitation 10: Quiz 1 Review
Description: This recitation covers several practice problems for Quiz 1, taken from previous semesters of 6.006. Instructor: Victor Costan
Introduction To MATLAB Programming - Lecture 4: Plotting
Introduction To MATLAB Programming - Lecture 4: Plotting
Description: This video lecture demonstrates how to manipulate the style, axes, and position of plots in MATLAB and how to create multiple subplots. Instructor: Yossi Farjoun
Signals and Systems - Lecture 20: Applications of Fourier ...
Signals and Systems - Lecture 20: Applications of Fourier Transforms
Instructor: Dennis Freeman Description: Three examples of Fourier transforms in action are given: removing noise from an electrocardiogram signal, using laser diffraction to calculate the groove spacing on CDs and DVDs, and determining the structure of DNA via x-ray ...
Signals and Systems - Lecture 21: Sampling
Signals and Systems - Lecture 21: Sampling
Instructor: Dennis Freeman Description: Sampling produces a discrete-time (digital) signal from a continuous-time (physical) phenomenon. Anti-aliasing and reconstruction filters remove unnecessary frequencies while retaining enough information to reconstruct the ...
Signals and Systems - Lecture 22: Sampling and Quantization
Signals and Systems - Lecture 22: Sampling and Quantization
Instructor: Dennis Freeman Description: Digital audio, images, video, and communication signals use quantization to create discrete representations of continuous phenomena. Efficient transmission and reconstruction uses techniques such as dithering, progressive ...