scientific article; zbMATH DE number 2079414
From MaRDI portal
Publication:4471374
zbMath1092.68660MaRDI QIDQ4471374
Mihai Bădoiu, Kenneth L. Clarkson
Publication date: 28 July 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (32)
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ Dynamic coresets ⋮ 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 ⋮ A branch-and-bound method for the minimum \(k\)-enclosing ball problem ⋮ 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 ⋮ Streaming Algorithms for Smallest Intersecting Ball of Disjoint Balls ⋮ A stochastic algorithm finding generalized means on compact manifolds ⋮ No dimension-independent core-sets for containment under homothetics ⋮ Random Projection and Recovery for High Dimensional Optimization with Arbitrary Outliers ⋮ Core-Sets: Updated Survey ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ Solving the Chromatic Cone Clustering Problem via Minimum Spanning Sphere ⋮ Analysis of incomplete data and an intrinsic-dimension Helly theorem ⋮ Minimal containment under homothetics: a simple cutting plane approach ⋮ Faster balanced clusterings in high dimension ⋮ Faster core-set constructions and data-stream algorithms in fixed dimensions ⋮ On a minimum enclosing ball of a collection of linear subspaces ⋮ Efficient approximation algorithms for clustering point-sets ⋮ Practical methods for shape fitting and kinetic data structures using coresets ⋮ On coresets for support vector machines ⋮ Approximate minimum enclosing balls in high dimensions using core-sets ⋮ Riemannian \(L^p\) averaging on Lie group of nonzero quaternions ⋮ Greedy Strategy Works for k-Center Clustering with Outliers and Coreset Construction ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ Minimum-volume enclosing ellipsoids and core sets
This page was built for publication:
