Probabilistic smallest enclosing ball in high dimensions via subgradient sampling

DOI10.4230/LIPIcs.SoCG.2019.47OpenAlexW2915833405MaRDI QIDQ5088979

Alexander Munteanu, Amer Krivošija

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1902.10966

zbMATH Keywords

convex optimizationkernel methodsprobabilistic datageometric mediansupport vector data descriptionsmallest enclosing ball

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Support vector data description
• On the point for which the sum of the distances to \(n\) given points is minimum
• On randomized one-round communication complexity
• Introductory lectures on convex optimization. A basic course.
• Weiszfeld's method: old and new results
• Streaming algorithms for extent problems in high dimensions
• Optimal core-sets for balls
• Clustering for metric and nonmetric distance measures
• Distributed Computing by Mobile Robots: Gathering
• Linear-time approximation schemes for clustering problems in any dimensions
• Approximate clustering via core-sets
• A general purpose unequal probability sampling plan
• Stochastic k-Center and j-Flat-Center Problems
• Smallest enclosing ball for probabilistic data
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• Geometric median in nearly linear time

This page was built for publication: Probabilistic smallest enclosing ball in high dimensions via subgradient sampling