666 search results - page 72 / 134 » Unbalanced Graph Cuts |
DM
1998
13 years 10 months ago
1998
For every integer p > 0 let f(p) be the minimum possible value of the maximum weight of a cut in an integer weighted graph with total weight p. It is shown that for every large...
JCT
2002
13 years 10 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
ICCS
2005
Springer
14 years 3 months ago
2005
Springer
A main feature of many logics used in computer science is a means to express quantification. Usually, syntactical devices like variables and quantifiers are used for this purpose...
ECCV
2006
Springer
15 years 4 days ago
2006
Springer
Algorithms for discrete energy minimization play a fundamental role for low-level vision. Known techniques include graph cuts, belief propagation (BP) and recently introduced tree-...