APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY

DOI10.1142/S0218195913600066zbMath1300.68049OpenAlexW2107485210MaRDI QIDQ2875644

Suresh Venkatasubramanian, John Moeller, Amirali Abdullah

Publication date: 11 August 2014

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195913600066

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Measures of information, entropy (94A17)

Related Items (1)

On proving 𝐶^{1,𝛼}_{𝑙𝑜𝑐}-estimates for convex functions

Cites Work

• I-divergence geometry of probability distributions and minimization problems
• Approximate nearest neighbor queries revisited
• Fast algorithms for computing the smallest \(k\)-enclosing circle
• On the smallest enclosing information disk
• Sided and Symmetrized Bregman Centroids
• On Information and Sufficiency
• Logistic regression, AdaBoost and Bregman distances
• Bregman Voronoi diagrams

This page was built for publication: APPROXIMATE BREGMAN NEAR NEIGHBORS IN SUBLINEAR TIME: BEYOND THE TRIANGLE INEQUALITY