1461 search results - page 134 / 293 » Complexity of Graph Covering Problems |
141
click to vote
PAMI
2010
14 years 8 months ago
2010
—This paper addresses the problem of self-validated labeling of Markov random fields (MRFs), namely to optimize an MRF with unknown number of labels. We present graduated graph c...
ENDM
2007
14 years 10 months ago
2007
An s-graph is a graph with two kind of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into pa...
ICLP
1997
Springer
15 years 2 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
DATE
2007
IEEE
15 years 4 months ago
2007
IEEE
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
In this paper, we tackle the problem of localizing graphical symbols on complex technical document images by using an original approach to solve the subgraph isomorphism problem. ...