Minimum Covering Ellipses
From MaRDI portal
Cited in
(21)- Moment inequalities for random variables in computational geometry
- The excess-mass ellipsiod
- Minimum-volume ellipsoids containing compact sets: Application to parameter bounding
- A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane
- Smallest nonparametric tolerance regions.
- From approximate balls to approximate ellipses
- Cube root weak convergence of empirical estimators of a density level set
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimal experimental design and some related control problems
- Quantile approximation for robust statistical estimation and \(k\)-enclosing problems
- Exact primitives for smallest enclosing ellipses
- Tying up the loose ends in simple, multiple, joint correspondence analysis
- The multivariate Fermi-Dirac distribution and its applications in quality control
- Techniques for exploring the suboptimal set
- Rank-two update algorithms for the minimum volume enclosing ellipsoid problem
- Finding minimum volume circumscribing ellipsoids using generalized copositive programming
- Robust winsorized regression using bootstrap approach
- Trimmed \(\tilde T^2\): A robust analog of Hotelling's \(T^2\)
- A simulation study of the finite-sample performance of the sample scale curve as an estimator of its population counterpart
- Minimum-volume enclosing ellipsoids and core sets
- Defining extremes and trimming by minimum covering sets
This page was built for publication: Minimum Covering Ellipses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3923192)
