Sciweavers

163 search results - page 23 / 33
» The Weighted Integrity Problem is Polynomial for Interval Gr...
Sort
View
APPROX
2006
Springer
162views Algorithms» more  APPROX 2006»
13 years 11 months ago
Approximating Precedence-Constrained Single Machine Scheduling by Coloring
Abstract. This paper investigates the relationship between the dimension theory of partial orders and the problem of scheduling precedenceconstrained jobs on a single machine to mi...
Christoph Ambühl, Monaldo Mastrolilli, Ola Sv...
IPMI
2011
Springer
12 years 11 months ago
Surface-Region Context in Optimal Multi-object Graph-Based Segmentation: Robust Delineation of Pulmonary Tumors
Abstract. Multi-object segmentation with mutual interaction is a challenging task in medical image analysis. We report a novel solution to a segmentation problem, in which target o...
Qi Song, Mingqing Chen, Junjie Bai, Milan Sonka, X...
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 1 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
ADCM
2004
74views more  ADCM 2004»
13 years 7 months ago
Extremal Systems of Points and Numerical Integration on the Sphere
This paper considers extremal systems of points on the unit sphere Sr Rr+1, related problems of numerical integration and geometrical properties of extremal systems. Extremal sys...
Ian H. Sloan, Robert S. Womersley
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 4 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller