Optimal core-sets for balls

DOI10.1016/J.COMGEO.2007.04.002MaRDI QIDQ2479470zbMATH OpenOpenAlexFDO

Authors Mihai Bădoiu, Kenneth L. Clarkson

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 2079414
• Approximate minimum enclosing balls in high dimensions using core-sets
• Minimum-volume enclosing ellipsoids and core sets
• Two Algorithms for the Minimum Enclosing Ball Problem
• No dimension-independent core-sets for containment under homothetics

Cites work

• Approximate clustering via core-sets
• Approximate minimum enclosing balls in high dimensions using core-sets
• Projective clustering in high dimensions using core-sets
• Reductions among high dimensional proximity problems

Cited in

(28)

• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
• Clustering in Hilbert's projective geometry: the case studies of the probability simplex and the elliptope of correlation matrices
• ON THE BOUNDEDNESS OF AN ITERATION INVOLVING POINTS ON THE HYPERSPHERE
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. II.
• Approximation vector machines for large-scale online learning
• Complexity and approximation of the smallest \(k\)-enclosing ball problem
• Averaging symmetric positive-definite matrices
• The maximum vector-angular margin classifier and its fast training on large datasets using a core vector machine
• On approximability of minimum color-spanning ball in high dimensions
• A dual simplex-type algorithm for the smallest enclosing ball of balls
• Polynomial time approximation schemes for all 1-center problems on metric rational set similarities
• A novel Frank-Wolfe algorithm. Analysis and applications to large-scale SVM training
• Spreading points using gradient and tabu
• Algorithm 1024: Spherical Triangle Algorithm: A Fast Oracle for Convex Hull Membership Queries
• No dimension-independent core-sets for containment under homothetics
• On the elimination of inessential points in the smallest enclosing ball problem
• Rank-two update algorithm versus Frank-Wolfe algorithm with away steps for the weighted Euclidean one-center problem
• Multi-view L2-SVM and its multi-view core vector machine
• Geometric matrix midranges
• scientific article; zbMATH DE number 2079414 (Why is no real title available?)
• Streaming algorithms for extent problems in high dimensions
• Approximation algorithms for color spanning diameter
• Maximal and minimal balls
• scientific article; zbMATH DE number 7164768 (Why is no real title available?)
• FRSDE: Fast reduced set density estimator using minimal enclosing ball approximation
• Core-sets: updated survey
• An online core vector machine with adaptive MEB adjustment

This page was built for publication: Optimal core-sets for balls

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479470)