computational geometry

Accelerating ERM for data-driven algorithm design using output-sensitive techniques NeurIPS 2024 Fiber Monte Carlo ICLR 2024 A Nearly Tight Bound for Fitting an Ellipsoid to Gaussian Random Points COLT 2023 Active Nearest Neighbor Regression Through Delaunay Refinement ICML 2022 A Differentially Private Linear-Time fPTAS for the Minimum Enclosing Ball Problem NeurIPS 2022 Collision Detection Accelerated: An Optimization Perspective RSS 2022 A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning NeurIPS 2021 Shape-based Feature Engineering for Solar Flare Prediction AAAI 2021 Wasserstein barycenters can be computed in polynomial time in fixed dimension JMLR 2021 Robust Vertex Enumeration for Convex Hulls in High Dimensions AISTATS 2018 Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning AISTATS 2015 A Fast and Robust Algorithm to Count Topologically Persistent Holes in Noisy Clouds CVPR 2014 Coresets for k-Segmentation of Streaming Data NeurIPS 2014 On the complexity of the set of three-finger caging grasps of convex polygons RSS 2009 Core Vector Machines: Fast SVM Training on Very Large Data Sets JMLR 2005