1115 search results - page 19 / 223 » Active Graph Cuts |
ICPR
2004
IEEE
14 years 9 months ago
2004
IEEE
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given an undirected graph G and an error parameter > 0, the graph sparsification problem requires sampling edges in G and giving the sampled edges appropriate weights to obtai...
JCT
2006
13 years 8 months ago
2006
Thomassen conjectured that every 4-connected line graph is hamiltonian. A vertex cut X of G is essential if G-X has at least two nontrivial components. We prove that every 3-conne...
DAC
1997
ACM
14 years 5 days ago
1997
ACM
This paper presents a verification technique which is specifically targeted to formally comparing large combinational circuits with some structural similarities. The approach co...
ICCV
2009
IEEE
15 years 29 days ago
2009
IEEE
Markov Random Field is now ubiquitous in many formulations
of various vision problems. Recently, optimization
of higher-order potentials became practical using higherorder
graph...