657 search results - page 51 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
165
click to vote
ECCV
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Graph cuts has emerged as a preferred method to solve a class of energy minimization problems in computer vision. It has been shown that graph cut algorithms designed kee...
ISAAC
2004
Springer
15 years 5 months ago
2004
Springer
We consider two multicriteria versions of the global minimum cut problem in undirected graphs. In the k-criteria setting, each edge of the input graph has k non-negative costs ass...
161
click to vote
JCO
2006
14 years 11 months ago
2006
We study a novel "coverage by directional sensors" problem with tunable orientations on a set of discrete targets. We propose a Maximum Coverage with Minimum Sensors (MCM...
149
click to vote
STOC
2007
ACM
16 years 3 days ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
ANCS
2007
ACM
15 years 3 months ago
2007
ACM
All-optical packet switching is a promising candidate for future high-speed switching. However, due to the absence of optical Random Access Memory, the traditional Virtual Output ...