scientific article; zbMATH DE number 6469174
From MaRDI portal
Publication:5501289
zbMath1317.68246MaRDI QIDQ5501289
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linear programming (90C05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)
Related Items (38)
β-Skeleton depth functions and medians ⋮ Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data ⋮ A survey of mass partitions ⋮ Minimum dilation stars ⋮ Bipartite diameter and other measures under translation ⋮ A new approach for the computation of halfspace depth in high dimensions ⋮ Some results on the computing of Tukey's halfspace median ⋮ Penalty-based aggregation of multidimensional data ⋮ Improved bounds for discrete Voronoi games ⋮ Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\) ⋮ The 2-center problem in three dimensions ⋮ Packing plane spanning trees into a point set ⋮ Helly’s theorem: New variations and applications ⋮ Approximating Tverberg points in linear time for any fixed dimension ⋮ A proof of the Oja depth conjecture in the plane ⋮ On the least trimmed squares estimator ⋮ On Combinatorial Depth Measures ⋮ On strong centerpoints ⋮ Algorithms for bivariate zonoid depth ⋮ Efficient algorithms for maximum regression depth ⋮ Optimal location of transportation devices ⋮ Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points ⋮ Computational aspects of the colorful Carathéodory theorem ⋮ On approximate range counting and depth ⋮ Centerpoints: A Link between Optimization and Convex Geometry ⋮ Computing the center region and its variants ⋮ Unnamed Item ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ Approximate centerpoints with proofs ⋮ Active-learning a convex body in low dimensions ⋮ Stabbing pairwise intersecting disks by five points ⋮ Resilient distributed vector consensus using centerpoint ⋮ Approximate calculation of Tukey's depth and median with high-dimensional data ⋮ Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Unnamed Item ⋮ Optimal Algorithms for Geometric Centers and Depth ⋮ Barycentric cuts through a convex body
This page was built for publication: