Efficient Determination of Gibbs Estimators with Submodular Energy Functions

Simple item page
dc.creatorZalesky, Boris
dc.date2003-04-03
dc.date.accessioned2026-07-07T08:06:07Z
dc.date.available2026-07-07T08:06:07Z
dc.descriptionCombinatorial algorithms for minimization of functions of many variables, which take their values in finite totally ordered sets, are developed. For that the decomposition of the functions by Boolean polynomials is used. The modified SFM algorithm for minimization of submodular Boolean polynomials is described. The representation of some subclass of submodular Boolean polynomials by graphs is derived in order to make possible use of the graph cut technique.
dc.description18 pages, 3 figures
dc.identifierhttps://arxiv.org/abs/math/0304041
dc.identifierhttp://arxiv.org/abs/math/0304041
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/130494
dc.subjectOptimization and Control
dc.subjectStatistics Theory
dc.subject90C27, 62N, 62H, 68W
dc.titleEfficient Determination of Gibbs Estimators with Submodular Energy Functions
dc.typetext

Files

Collections

arXiv