296 search results - page 14 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
EMMCVPR
2007
Springer
15 years 3 months ago
2007
Springer
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
96
Voted
ICMCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Segmentation of video objects from background is a popular computer vision problem and has many important applications. Most existing methods are either computationally expensive ...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
IM
2007
14 years 9 months ago
2007
A local graph partitioning algorithm finds a cut near a specified starting vertex, with a running time that depends largely on the size of the small side of the cut, rather than...
ANOR
2004
14 years 9 months ago
2004
We present an iterative cutting plane method for minimizing staffing costs in a service system subject to satisfying acceptable service level requirements over multiple time perio...