666 search results - page 1 / 134 » Unbalanced Graph Cuts |
ESA
2005
Springer
13 years 11 months ago
2005
Springer
We introduce the Minimum-size bounded-capacity cut (MinSBCC) problem, in which we are given a graph with an identified source and seek to find a cut minimizing the number of node...
ICDM
2009
IEEE
13 years 3 months ago
2009
IEEE
Clustering methods usually require to know the best number of clusters, or another parameter, e.g. a threshold, which is not ever easy to provide. This paper proposes a new graph-b...
DM
2006
13 years 5 months ago
2006
Given a 3-connected biased graph with three node-disjoint unbalanced circles, at most one of which is a loop, we describe how the bias matroid of is uniquely represented by .
IWOMP
2009
Springer
14 years 9 days ago
2009
Springer
The UTS benchmark is used to evaluate task parallelism in OpenMP 3.0 as implemented in a number of recently released compilers and run-time systems. UTS performs parallel search of...
Presentation
Neat presentation about the basics of Graph Cuts by Yuri Boykov at the European Conference on Computer Vision (ECCV) 2006.