Pages that link to "Item:Q5687654"
From MaRDI portal
The following pages link to APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS (Q5687654):
Displayed 20 items.
- Small strong epsilon nets (Q396471) (← links)
- Dynamic coresets (Q834605) (← links)
- An optimal extension of the centerpoint theorem (Q924064) (← links)
- Centerpoints and Tverberg's technique (Q982949) (← links)
- Approximate centerpoints with proofs (Q991175) (← links)
- Optimal outlier removal in high-dimensional spaces (Q1887715) (← links)
- Resilient distributed vector consensus using centerpoint (Q2063807) (← links)
- No-dimensional Tverberg theorems and algorithms (Q2105318) (← links)
- Computing the center region and its variants (Q2272371) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- k-Centerpoints Conjectures for Pointsets in ℝd (Q3459046) (← links)
- (Q4558543) (← links)
- Robust Tverberg and Colourful Carathéodory Results via Random Choice (Q4635512) (← links)
- FAST SOFTWARE FOR BOX INTERSECTIONS (Q4818605) (← links)
- Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data (Q5037559) (← links)
- Journey to the Center of the Point Set (Q5088971) (← links)
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg (Q5241224) (← links)
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS (Q5261015) (← links)
- Optimal Algorithms for Geometric Centers and Depth (Q5864667) (← links)
- Approximating Tverberg points in linear time for any fixed dimension (Q5891192) (← links)