Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Sparsest Subgraph: Densest Subgraph
Graph Chatbot
Related lectures (30)
Previous
Page 3 of 3
Next
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Optimization Techniques: Convexity in Machine Learning
Covers optimization techniques in machine learning, focusing on convexity and its implications for efficient problem-solving.
Decision Making Under Uncertainty
Explores decision-making under uncertainty, focusing on Kilian Schindler's posthumous PhD thesis on scalable stochastic optimization and scenario reduction.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Convex Optimization: Self-dual Cones
Explores self-dual cones in convex optimization and their applications in various optimization problems.
Convex Optimization
Introduces convex optimization, focusing on the importance of convexity in algorithms and optimization problems.
Optimization Problems: Greedy Algorithms
Explores optimization problems and greedy algorithms to find the best solutions efficiently.
Contact-Implicit Planning and Control
Introduces state-triggered constraints for non-prehensile manipulation and showcases improved performance through feedback control.
Dynamic Programming: Fibonacci Numbers
Covers dynamic programming with a focus on Fibonacci numbers and efficient calculation algorithms.
Simplex Method: Basics and Applications
Covers the basics of the Simplex method and its application in solving optimization problems.
