402 search results - page 39 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
WG
2004
Springer
14 years 23 days ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
BMVC
2010
13 years 2 months ago
2010
Saliency detection is a well researched problem in computer vision. In previous work, most of the effort is spent on manually devising a saliency measure. Instead we propose a sim...
MVA
2008
13 years 7 months ago
2008
This paper presents a new graph cut-based multiple active contour algorithm to detect optimal boundaries and regions in images without initial contours and seed points. The task of...
ICCV
2011
IEEE
12 years 7 months ago
2011
IEEE
We propose a novel patch-based image representation that is useful because it (1) inherently detects regions with repetitive structure at multiple scales and (2) yields a paramete...
SODA
1997
ACM
13 years 8 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...