58 search results - page 1 / 12 » Graph Invariants as Necessary Conditions for Global Constrai... |
CP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. This article presents a database of about 200 graph invariants for deriving systematically necessary conditions from the graph properties based representation of global c...
CPAIOR
2007
Springer
13 years 11 months ago
2007
Springer
Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
ICCV
2011
IEEE
12 years 4 months ago
2011
IEEE
Many state-of-the-art segmentation algorithms rely on Markov or Conditional Random Field models designed to enforce spatial and global consistency constraints. This is often accom...
ICPR
2008
IEEE
14 years 6 months ago
2008
IEEE
In this paper we propose a novel method for generic object localization. The method is based on modeling the object as a graph at two levels: a local substructural representation ...