666 search results - page 73 / 134 » Unbalanced Graph Cuts |
96
Voted
DAM
2007
15 years 2 months ago
2007
Given a graph G = (V, E) with a cost function c(S) ≥ 0 ∀S ⊆ V , we want to represent all possible min-cut values between pairs of vertices i and j. We consider also the spec...
123
Voted
SIROCCO
2010
15 years 4 months ago
2010
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
148
Voted
IWPEC
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
134
click to vote
PR
2008
15 years 2 months ago
2008
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut p...