1115 search results - page 72 / 223 » Active Graph Cuts |
COMBINATORICS
2006
13 years 8 months ago
2006
Let Sm,n be the graph on the vertex set Zm
SODA
1997
ACM
13 years 9 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 1 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
14 years 10 months 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-...
ALGORITHMICA
2011
13 years 3 months ago
2011
We investigate the natural situation of the dissemination of information on various graph classes starting with a random set of informed vertices called active. Initially active ve...