90 search results - page 3 / 18 » A Global Constraint for Graph Isomorphism Problems |
FOCS
2007
IEEE
14 years 3 days ago
2007
IEEE
: It is well-known that constraint satisfaction problems (CSP) over an unbounded domain can be solved in time nO(k) if the treewidth of the primal graph of the instance is at most ...
CVPR
2006
IEEE
13 years 11 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...
CEC
2007
IEEE
14 years 3 days ago
2007
IEEE
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
CVPR
2004
IEEE
14 years 7 months ago
2004
IEEE
Abstract-- Efficient detection of globally optimal surfaces representing object boundaries in volumetric datasets is important and remains challenging in many medical image analysi...
CVPR
2006
IEEE
14 years 7 months ago
2006
IEEE
Resolving local ambiguities is an important issue for shape from shading (SFS). Pixel ambiguities of SFS can be eliminated by propagation approaches. However, patch ambiguities st...