42 search results - page 4 / 9 » Classes of Submodular Constraints Expressible by Graph Cuts |
CVPR
2006
IEEE
14 years 1 months ago
2006
IEEE
We introduce the term cosegmentation which denotes the task of segmenting simultaneously the common parts of an image pair. A generative model for cosegmentation is presented. Inf...
ICALP
2010
Springer
14 years 4 days ago
2010
Springer
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
EKAW
2004
Springer
14 years 22 days ago
2004
Springer
Capturing and exploiting knowledge is at the heart of several important problems such as decision making, the semantic web, and intelligent agents. The captured knowledge must be a...
BVAI
2007
Springer
14 years 1 months ago
2007
Springer
We tested the efficiency of category learning when participants are provided only with pairs of objects, known to belong either to the same class (Positive Equivalence Constraints ...
ICCS
2005
Springer
14 years 26 days ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...