Sciweavers

2816 search results - page 19 / 564
» Submodular function minimization
Sort
View
WCE
2007
14 years 2 days ago
A Multidimensional Bisection Method for Minimizing Function over Simplex
—A new method for minimization problem over simplex, as a generalization of a well-known in onedimensional optimization bisection method is proposed. The convergence of the metho...
A. N. Baushev, E. Y. Morozova
VLSID
1996
IEEE
135views VLSI» more  VLSID 1996»
14 years 3 months ago
Cubical CAMP for minimization of Boolean functions
The paper presents QCAMP, a cube-based algorithm for minimization of single Boolean functions. The algorithm does not generate all the prime cubes, nor does it require the Off-set...
Nripendra N. Biswas, C. Srikanth, James Jacob
PPSN
2004
Springer
14 years 4 months ago
An Improved Evaluation Function for the Bandwidth Minimization Problem
This paper introduces a new evaluation function, called δ, for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our Î...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CVPR
2009
IEEE
15 years 6 months ago
Minimizing Sparse Higher Order Energy Functions of Discrete Variables
Higher order energy functions have the ability to encode high level structural dependencies between pixels, which have been shown to be extremely powerful for image labeling pro...
Carsten Rother (Microsoft Research Cambridge), Pus...
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 11 months ago
Minimization of entropy functionals
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
Christian Léonard