Farouk Harb: Revisiting Random Points: Combinatorial Complexity and Algorithms
49:16
Natan Rubin: Improved Bounds for Point Selections and Halving Hyperplanes in Higher Dimensions
43:59
Kien Huynh: Sweeping a Polygonal Domain with a Variable Length Line Segment
49:41
Sariel Har-Peled: The Fréchet Distance Unleashed: Approximating a Dog with a Frog
1:02:19
MIT Robotics - Russ Tedrake - Planning with Graphs of Convex Sets (in the age of foundation models)
59:40
IDWSDS 2024 - S32: Next Generation: Showcasing Young Portuguese Talent in Statistics & Data Science
10:06
Monte Carlo Simulation
51:26
Jeff Phillips: Coresets for Finding Approximate Maximum in a Range Space
2:00:01