Optimal core-sets for balls
From MaRDI portal
Publication:2479470
DOI10.1016/j.comgeo.2007.04.002zbMath1138.68056OpenAlexW1987492370MaRDI QIDQ2479470
Kenneth L. Clarkson, Mihai Bădoiu
Publication date: 26 March 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.04.002
Related Items
Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries ⋮ ON THE BOUNDEDNESS OF AN ITERATION INVOLVING POINTS ON THE HYPERSPHERE ⋮ Unnamed Item ⋮ Polynomial time approximation schemes for all 1-center problems on metric rational set similarities ⋮ On approximability of minimum color-spanning ball in high dimensions ⋮ Multi-view L2-SVM and its multi-view core vector machine ⋮ Spreading points using gradient and tabu ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I. ⋮ Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II. ⋮ No dimension-independent core-sets for containment under homothetics ⋮ Approximation algorithms for color spanning diameter ⋮ The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine ⋮ On the elimination of inessential points in the smallest enclosing ball problem ⋮ Core-Sets: Updated Survey ⋮ Averaging Symmetric Positive-Definite Matrices ⋮ Geometric Matrix Midranges ⋮ A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training ⋮ FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation ⋮ An online core vector machine with adaptive MEB adjustment ⋮ A dual simplex-type algorithm for the smallest enclosing ball of balls ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem ⋮ Probabilistic smallest enclosing ball in high dimensions via subgradient sampling ⋮ Unnamed Item ⋮ Streaming algorithms for extent problems in high dimensions ⋮ Complexity and approximation of the smallest \(k\)-enclosing ball problem
Cites Work
