Sparsest Cut, Discrete Differentiation, and Local Rigidity of Sets in the Plane
About this video
Hand-picked by a BrighterTube curator · found via round-3 back catalogue of a channel Lumen picks video by video · 82% confidenceExplains sparsest cut problems, discrete differentiation, and local rigidity in geometric analysis. A research lecture on mathematical theory and algorithms.
A 52-minute video from Microsoft Research: “Sparsest Cut, Discrete Differentiation, and Local Rigidity of Sets in the Plane”.
Video by Microsoft Research, played through YouTube's embedded player.