APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
From MaRDI portal
Publication:5687654
DOI10.1142/S021819599600023XzbMATH Open0859.68114WikidataQ56503423 ScholiaQ56503423MaRDI QIDQ5687654FDOQ5687654
Authors: Kenneth L. Clarkson, David Eppstein, C. Sturtivant, Gary L. Miller, Shang-Hua Teng 
Publication date: 16 December 1996
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Recommendations
Cited In (24)
- Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
- No-dimensional Tverberg theorems and algorithms
- Dynamic coresets
- Small strong epsilon nets
- An optimal extension of the centerpoint theorem
- Approximate center points with proofs
- Approximate centerpoints with proofs
- Weighted SGD for \(\ell_p\) regression with randomized preconditioning
- Support vector machines and Radon's theorem
- Approximate center points in dense point sets
- \(k\)-centerpoints conjectures for pointsets in \(\mathbb{R}^d\)
- Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Optimal algorithms for geometric centers and depth
- FAST SOFTWARE FOR BOX INTERSECTIONS
- Title not available (Why is that?)
- Journey to the Center of the Point Set
- Title not available (Why is that?)
- Centerpoints and Tverberg's technique
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- Resilient distributed vector consensus using centerpoint
- Optimal outlier removal in high-dimensional spaces
- Helly’s theorem: New variations and applications
- Approximating Tverberg points in linear time for any fixed dimension
Uses Software
This page was built for publication: APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5687654)
