arXiv (OAI Expanded)
open access
Minimum enclosing Bregman balls made easy
In this work, we revisit the problem of computing minimum enclosing Bregman balls (Bregman MEBs) of finite sets of parameters. First, we show that Bregman MEBs are equivalent to MEBs of corresponding weighted point sets with respect to the power distance. We then report an efficient Frank--Wolfe $(1
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Minimum enclosing Bregman balls made easy#925214
- Binary $k$-Center under a Hard Threshold with Applications to Delegated Voting#1129976
- Weak $k$-metric dimension of Hamming graphs: rectangular products and near-maximum parameters#1116492
- Maximum number of spanning trees in bipartite graphs with a given diameter#1109503
- Exact majority C-colourings of balanced Hamming graphs and grids#1115630
Record · ID 920979
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive