3 search results - page 1 / 1 » Minimization of Locally Defined Submodular Functions by Opti... |
CONSTRAINTS
2008
13 years 9 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
AI
2010
Springer
13 years 9 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
TIP
2010
13 years 3 months ago
2010
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...