A simple linear recurrence computes the barycentric coordinate of the smallest-enclosing-ball center, with a proof of convergence when the circumcenter lies in the simplex and a heuristic outside that regime.
An algorithm for computing the capacity of arbitrary discrete memoryless channels,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
extend 1representative citing papers
citing papers explorer
-
A Sequential Computation Algorithm for the Center of the Smallest Enclosing Ball
A simple linear recurrence computes the barycentric coordinate of the smallest-enclosing-ball center, with a proof of convergence when the circumcenter lies in the simplex and a heuristic outside that regime.