1133 search results - page 21 / 227 » Basics of Graph Cuts |
CPC
2006
14 years 9 months ago
2006
Abstract. We show that a maximum cut of a random graph below the giantcomponent threshold can be found in linear space and linear expected time by a simple algorithm. In fact, the ...
TAMC
2009
Springer
15 years 4 months ago
2009
Springer
We investigate a natural combinatorial optimization problem called the Label Cut problem. Given an input graph G with a source s and a sink t, the edges of G are classified into ...
52
Voted
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
ICPR
2004
IEEE
15 years 10 months ago
2004
IEEE
CORR
2010
Springer
14 years 9 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...