1629 search results - page 158 / 326 » Hardness Results and Efficient Algorithms for Graph Powers |
IPMI
2005
Springer
15 years 11 months ago
2005
Springer
This paper presents a general graph-theoretic technique for simultaneously segmenting multiple closed surfaces in volumetric images, which employs a novel graph-construction scheme...
ASPLOS
1994
ACM
15 years 2 months ago
1994
ACM
Synchronization algorithms that are efficient across a wide range of applications and operating conditions are hard to design because their performance depends on unpredictable ru...
ICCV
1999
IEEE
15 years 2 months ago
1999
IEEE
An approach to extract watersheds and watercourses, as well as their corresponding valleys and hills, from images with subpixel precision is proposed. The critical points of the t...
APPROX
2010
Springer
14 years 12 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
CASES
2006
ACM
15 years 2 months ago
2006
ACM
When integrating software threads together to boost performance on a processor with instruction-level parallel processing support, it is rarely clear which code regions should be ...