Smallest enclosing ball for probabilistic data

DOI10.1145/2582112.2582114zbMATH Open1395.68312OpenAlexW2157754768MaRDI QIDQ4635545FDOQ4635545

Authors: Alexander Munteanu, Christian Sohler, Dan Feldman 

Publication date: 23 April 2018

Published in: Proceedings of the thirtieth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2582112.2582114

Recommendations

• scientific article; zbMATH DE number 2079414
• APPROXIMATING SMALLEST ENCLOSING BALLS WITH APPLICATIONS TO MACHINE LEARNING
• Computational Science and Its Applications – ICCSA 2004
• THE SMALLEST ENCLOSING BALL OF BALLS: COMBINATORIAL STRUCTURE AND ALGORITHMS
• The smallest enclosing ball of balls: combinatorial structure and algorithms

zbMATH Keywords

sampling1-mediansmallest enclosing ballprobabilistic data

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Cited In (7)

• Probabilistic smallest enclosing ball in high dimensions via subgradient sampling
• Maximum box problem on stochastic points
• Approximation algorithms for stochastic combinatorial optimization problems
• Snell envelope with small probability criteria
• Clustering with faulty centers
• Visibility testing and counting for uncertain segments
• Maximizing expected utility for stochastic combinatorial optimization problems

This page was built for publication: Smallest enclosing ball for probabilistic data

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