scientific article; zbMATH DE number 6469174

zbMATH Open1317.68246MaRDI QIDQ5501289FDOQ5501289

Authors: Timothy M. Chan 

Publication date: 3 August 2015

Title of this publication is not available (Why is that?)

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

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)

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
• Approximate centerpoints with proofs
• On the least trimmed squares estimator
• Algorithms for bivariate zonoid depth
• An optimal randomized algorithm for \(d\)-variate zonoid depth
• Absolute approximation of Tukey depth: theory and experiments
• Stabbing pairwise intersecting disks by five points
• Active-learning a convex body in low dimensions
• Improved bounds for discrete Voronoi games
• Optimal algorithms for geometric centers and depth
• Efficient algorithms for maximum regression depth
• Some results on the computing of Tukey's halfspace median
• Approximate calculation of Tukey's depth and median with high-dimensional data
• Optimal location of transportation devices
• \(\beta\)-skeleton depth functions and medians
• Tverberg’s theorem is 50 years old: A survey
• Title not available (Why is that?)
• Space-efficient algorithm for computing a centerpoint of a set of points in \(\mathbb{R}^2\)
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• Bipartite diameter and other measures under translation
• On strong centerpoints
• 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
• A new approach for the computation of halfspace depth in high dimensions
• Approximating Tverberg points in linear time for any fixed dimension
• Fast implementation of the Tukey depth
• On Combinatorial Depth Measures
• Penalty-based aggregation of multidimensional data
• Title not available (Why is that?)
• Packing plane spanning trees into a point set
• 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)