On the smallest enclosing information disk

DOI10.1016/j.ipl.2007.08.007zbMath1184.68568OpenAlexW2031348368MaRDI QIDQ2380049

Frank Nielsen, Richard Nock

Publication date: 24 March 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2007.08.007

zbMATH Keywords

algorithmsdivergencecomputational information geometrysmallest enclosing ball

Mathematics Subject Classification ID

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

Related Items (5)

Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ Klee sets and Chebyshev centers for the right Bregman distance ⋮ Monte Carlo Information-Geometric Structures ⋮ Clustering in Hilbert’s Projective Geometry: The Case Studies of the Probability Simplex and the Elliptope of Correlation Matrices ⋮ APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY

Cites Work

• A subexponential bound for linear programming
• Unnamed Item
• Unnamed Item

This page was built for publication: On the smallest enclosing information disk