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