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