scientific article; zbMATH DE number 2079414
From MaRDI portal
Publication:4471374
Recommendations
Cited in
(46)- Practical methods for shape fitting and kinetic data structures using coresets
- No dimension-independent core-sets for containment under homothetics
- Faster balanced clusterings in high dimension
- On a minimum enclosing ball of a collection of linear subspaces
- A branch-and-bound method for the minimum \(k\)-enclosing ball problem
- A mixed breadth-depth first strategy for the branch and bound tree of Euclidean k-center problems
- On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
- Optimal core-sets for balls
- Faster core-set constructions and data-stream algorithms in fixed dimensions
- Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls
- Solving the chromatic cone clustering problem via minimum spanning sphere
- Core-sets: updated survey
- Averaging symmetric positive-definite matrices
- Two Algorithms for the Minimum Enclosing Ball Problem
- APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
- scientific article; zbMATH DE number 3913428 (Why is no real title available?)
- Computational complexity and approximation for a generalization of the Euclidean problem on the Chebyshev center
- Streaming and dynamic algorithms for minimum enclosing balls in high dimensions
- Streaming with minimum space: an algorithm for covering by two congruent balls
- Projective clustering in high dimensions using core-sets
- Smallest enclosing ball for probabilistic data
- Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
- Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction
- Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography
- A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
- Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
- Minimal containment under homothetics: a simple cutting plane approach
- New approximation algorithms for minimum enclosing convex shapes
- Coresets for polytope distance
- No dimension independent core-sets for containment under homothetics
- Approximate minimum enclosing balls in high dimensions using core-sets
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
- Analysis of incomplete data and an intrinsic-dimension Helly theorem
- A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee
- On coresets for support vector machines
- Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers
- Parameterized approximation algorithms and lower bounds for k-center clustering and variants
- A faster dual algorithm for the Euclidean minimum covering ball problem
- Clustering in polygonal domains
- Updatable estimation in generalized linear models with missing data
- On approximating the Riemannian 1-center
- Efficient approximation algorithms for clustering point-sets
- Riemannian L^p averaging on Lie group of nonzero quaternions
- Minimum-volume enclosing ellipsoids and core sets
- Dynamic coresets
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 Q4471374)
