Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Dynamic Programming: Longest Common Subsequence
Graph Chatbot
Related lectures (31)
Matrix Chain Multiplication
Delves into dynamic programming with a focus on Matrix Chain Multiplication and the longest common subsequence problem.
Matrix Chain Multiplication: Optimal Substructure and Recursive Formula
Explores optimal substructure and recursive formula in matrix chain multiplication using dynamic programming.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Matrix Multiplication and Divide-and-Conquer Techniques
Discusses matrix multiplication using divide-and-conquer techniques and introduces Strassen's algorithm for improved efficiency.
Linear Algebra: Matrices Properties
Explores properties of 3x3 matrices with real coefficients and determinant calculation methods.
Principles of Parallelism
Covers the basics of parallelism, including physical examples, historical context, multicore era, and parallel collections in Scala.
Matrix Operations: Definitions and Properties
Covers the definitions and properties of matrices, including matrix operations and determinants.
Cyclic Subspace Decomposition
Explores minimal annihilating polynomials and cyclic invariant subspaces, showcasing their practical applications through matrix computations.
Matrix-Matrix Multiplication: Algorithms and Applications
Explores theoretical and practical aspects of fast matrix-matrix multiplication algorithms and their significance in computer science.
Matrix Multiplication: Strassen's Algorithm
Introduces matrix multiplication and Strassen's algorithm, covering divide-and-conquer approach, data structures like heaps, and MAX-HEAPIFY operation.
Matrix Multiplication
MOOC: Linear Algebra (Part 1)
Covers matrix multiplication, properties, and the identity matrix in algebraic operations.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication algorithms, and complexity analysis.
Recursion Trees and Matrix Multiplication
Covers recursion trees, the maximum subarray problem, and matrix multiplication approaches.
Matrix Multiplication: Algorithms and Complexity
Covers matrix notation, arithmetic, multiplication, algorithms, and complexity of matrix multiplication.
Linear Algebra: Matrices and Operations
Introduces key concepts in linear algebra, including matrices, operations, and numerical invariants.
Matrix Computations: Low Rank Approximation
Explores the complexity of matrix computations, focusing on low rank approximation algorithms and their applications.
Isometries and Orthonormal Bases
Discusses isometries and orthonormal bases in mathematics.
Dynamic Programming: Matrix Chain Multiplication
Log in to Mediaspace to watch this video
Explores dynamic programming with a focus on optimizing Matrix Chain Multiplication.
Dynamic Programming: Matrix-chain Multiplication
Log in to Mediaspace to watch this video
Explores dynamic programming with a focus on matrix-chain multiplication and the importance of optimal substructure.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Log in to Mediaspace to watch this video
Introduces dynamic programming with a focus on rod cutting and matrix chain multiplication.
Previous
Page 1 of 2
Next
