Sciweavers

3 search results - page 1 / 1
» Minimization of Locally Defined Submodular Functions by Opti...
Sort
View
CONSTRAINTS
2008
138views more  CONSTRAINTS 2008»
13 years 3 months ago
Minimization of Locally Defined Submodular Functions by Optimal Soft Arc Consistency
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...
Martin C. Cooper
AI
2010
Springer
13 years 3 months ago
Soft arc consistency revisited
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...
Martin C. Cooper, Simon de Givry, M. Sanchez, Thom...
TIP
2010
205views more  TIP 2010»
12 years 10 months ago
Variational Region-Based Segmentation Using Multiple Texture Statistics
This paper addresses variational supervised texture segmentation. The main contributions are twofold. First, the proposed method circumvents a major problem related to classical t...
Imen Karoui, Ronan Fablet, Jean-Marc Boucher, Jean...