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
Convex Hulls: Complexity and Vertices
Graph Chatbot
Related lectures (49)
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Untitled
Coin Rendering: Part 1
MOOC: Information, Computation, Communication: Introduction to computational thinking
Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Distinct Elements: Count and Hash Functions
Covers counting distinct elements using hash functions and the median trick.
Algorithmic Complexity: Travel Time Analysis
Covers algorithmic complexity and travel time analysis, focusing on measuring the time taken by algorithms and evaluating their performance.
Density Matrix: Recap and Bloch 'Ball'
Covers the concept of density matrix and its properties, focusing on statistical mixtures and measurements.
Algorithmic Complexity: Definition and Examples
Explores algorithm correctness, worst-case complexity analysis, and efficiency comparison based on input size.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Tower of Hanoi: Recursion and Dynamic Programming
Explores the Tower of Hanoi algorithm, recursion, and dynamic programming in solving problems efficiently.
Primal-dual Optimization: Extra-Gradient Method
Explores the Extra-Gradient method for Primal-dual optimization, covering nonconvex-concave problems, convergence rates, and practical performance.
Linear Algebra: Efficiency and Complexity
Log in to Mediaspace to watch this video
Explores constraints, efficiency, and complexity in linear algebra, emphasizing convexity and worst-case complexity in algorithm analysis.
Linear Programming: Optimization and Constraints
Log in to Mediaspace to watch this video
Explores linear programming optimization with constraints, Dijkstra's algorithm, and LP formulations for finding feasible solutions.
Max Sum Diversification
Log in to Mediaspace to watch this video
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Elements of computational complexity
Log in to Mediaspace to watch this video
Covers classical and quantum computational complexity concepts and implications.
Linear Programming Basics
Log in to Mediaspace to watch this video
Introduces linear programming basics, including optimization problems, cost functions, simplex algorithm, geometry of linear programs, extreme points, and degeneracy.
Cutset Formulation: MST Problem
Log in to Mediaspace to watch this video
Explores the cutset formulation for the MST Problem and Gomory Cutting Planes method.
Convex Optimization: Elementary Results
Log in to Mediaspace to watch this video
Explores elementary results in convex optimization, including affine, convex, and conic hulls, proper cones, and convex functions.
Convex Sets: MGT-418 Lecture
Log in to Mediaspace to watch this video
On Convex Optimization covers course organization, mathematical optimization problems, solution concepts, and optimization methods.
Integer Optimization: Theory and Applications
Log in to Mediaspace to watch this video
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Optimal Transport: Rockafellar Theorem
Log in to Mediaspace to watch this video
Explores the Rockafellar Theorem in optimal transport, focusing on c-cyclical monotonicity and convex functions.
Previous
Page 1 of 3
Next
