scientific article; zbMATH DE number 6469174

MaRDI QIDQ5501289zbMATH OpenFDO

Authors Timothy M. Chan

Publication date 3 August 2015

Mathematics Subject Classification ID

Linear programming (90C05) Randomized algorithms (68W20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• The random Tukey depth
• An optimal randomized algorithm for \(d\)-variate zonoid depth
• Fast implementation of the Tukey depth
• Approximating Tukey's Depth
• Absolute approximation of Tukey depth: theory and experiments
• Efficient algorithms for maximum regression depth
• On a robust and efficient maximum depth estimator
• Optimal randomized algorithm for the density selection problem
• scientific article; zbMATH DE number 2038886

Cited in

(42)

• Stochastic Tverberg theorems with applications in multiclass logistic regression, separability, and centerpoints of data
• A proof of the Oja depth conjecture in the plane
• Barycentric cuts through a convex body
• Minimum dilation stars
• On the least trimmed squares estimator
• Approximate centerpoints with proofs
• Algorithms for bivariate zonoid depth
• Absolute approximation of Tukey depth: theory and experiments
• An optimal randomized algorithm for \(d\)-variate zonoid depth
• Stabbing pairwise intersecting disks by five points
• Active-learning a convex body in low dimensions
• Improved bounds for discrete Voronoi games
• Efficient algorithms for maximum regression depth
• Optimal algorithms for geometric centers and depth
• Some results on the computing of Tukey's halfspace median
• Optimal location of transportation devices
• Approximate calculation of Tukey's depth and median with high-dimensional data
• \(\beta\)-skeleton depth functions and medians
• Tverberg’s theorem is 50 years old: A survey
• scientific article; zbMATH DE number 7561404 (Why is no real title available?)
• Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
• On strong centerpoints
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Bipartite diameter and other measures under translation
• A survey of mass partitions
• On approximate range counting and depth
• The 2-center problem in three dimensions
• Computational aspects of the colorful Carathéodory theorem
• Resilient distributed vector consensus using centerpoint
• Helly’s theorem: New variations and applications
• Finite sample properties of parametric MMD estimation: robustness to misspecification and dependence
• Fast implementation of the Tukey depth
• Penalty-based aggregation of multidimensional data
• A new approach for the computation of halfspace depth in high dimensions
• Approximating Tverberg points in linear time for any fixed dimension
• On Combinatorial Depth Measures
• Packing plane spanning trees into a point set
• scientific article; zbMATH DE number 7306864 (Why is no real title available?)
• Ray-shooting depth: computing statistical data depth of point sets in the plane
• Centerpoints: a link between optimization and convex geometry
• Approximating the minimum closest pair distance and nearest neighbor distances of linearly moving points
• The random Tukey depth

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501289)