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
Closest Vector Problem: Voronoi Cells
Graph Chatbot
Related lectures (56)
Quasi-newton optimization
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Optimal Control: KKT Conditions
Explores optimal control and KKT conditions for non-linear optimization with constraints.
Harmonic Forms: Main Theorem
Explores harmonic forms on Riemann surfaces and the uniqueness of solutions to harmonic equations.
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Optimization Methods
Covers unconstrained and constrained optimization, optimal control, neural networks, and global optimization methods.
Untitled
Central Limit Theorem
Explores the Central Limit Theorem, convergence in law, characteristic functions, and moment problems in probability theory.
Convergence in Law: Theorem and Proof
Explores convergence in law for random variables, including Kolmogorov's theorem and proofs based on probability lemmas.
Compression: Kraft Inequality
Explains compression and Kraft inequality in codes and sequences.
Hermite Normal Form: Computation & Properties
Log in to Mediaspace to watch this video
Covers the computation and properties of the Hermite Normal Form (HNF) in matrix theory and lattice theory.
Closest Vector Problem: Voronoi Cells
Log in to Mediaspace to watch this video
Explores the closest vector problem in lattices and the role of Voronoi cells in determining the closest vector.
LLL Algorithm
Log in to Mediaspace to watch this video
Covers the LLL algorithm for reducing lattice bases to shorter and more orthogonal forms through iterative transformations.
Graph Sketching: Connected Components
Log in to Mediaspace to watch this video
Covers the concept of graph sketching with a focus on connected components.
Optimal Transport: Heat Equation and Metric Spaces
Log in to Mediaspace to watch this video
Explores optimal transport in heat equations and metric spaces.
Sparsest Cut: Bourgain's Theorem
Log in to Mediaspace to watch this video
Explores Bourgain's theorem on sparsest cut in graphs, emphasizing semimetrics and cut optimization.
Hoare Logic: Foundations and Applications
Log in to Mediaspace to watch this video
Covers Hoare Logic, its foundations, applications, and significance in program verification.
Sparsest Cut: ARV Theorem
Log in to Mediaspace to watch this video
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Zig Zag Lemma
Log in to Mediaspace to watch this video
Covers the Zig Zag Lemma and the long exact sequence of relative homology.
Untitled
Log in to Mediaspace to watch this video
Previous
Page 1 of 3
Next
