Simons Institute
Fast Streaming Euclidean Clustering with Constant Space
Explore streaming algorithms for k-median and k-means clustering, achieving constant space complexity independent of data size and aspect ratio. Improve space and update time for approximate subspace embeddings.
YouTube31 minutesSelf-pacedFree video
Institut des Hautes Etudes Scientifiques (IHES)
Euclidean Capacitated Vehicle Routing in Random Setting - A 1.55-Approximation Algorithm
Explore a 1.55-approximation algorithm for Euclidean capacitated vehicle routing in random settings, presented by Zipei Nie.
YouTube47 minutesSelf-pacedFree video
Hausdorff Center for Mathematics
On Gilles Pisier's Approach to Gaussian Concentration, Isoperimetry, and Poincare-Type Inequalities
Explore advanced mathematical concepts in measure concentration, isoperimetry, and Poincaré-type inequalities through Pisier's approach and its extensions to rotationally invariant distributions.
YouTube54 minutesSelf-pacedFree video
Institute for Advanced Study
Quadratic Stability of the Brunn-Minkowski Inequality
Delve into advanced mathematical concepts exploring the quadratic stability of Brunn-Minkowski inequality, its geometric implications, and connections to related inequalities in convex geometry.
YouTube1 hour 58 minutesSelf-pacedFree video