1671 search results - page 53 / 335 » On the Covering Steiner Problem |
SODA
2000
ACM
14 years 10 days ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
CVPR
2010
IEEE
14 years 7 months ago
2010
IEEE
We propose an approach to speeding up object detection, with an emphasis on settings where multiple object classes are being detected. Our method uses a segmentation algorithm to ...
ISPD
2010
ACM
14 years 5 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
ISPD
2003
ACM
14 years 4 months ago
2003
ACM
— In order to achieve timing closure on increasingly complex IC designs, buffer insertion needs to be performed on thousands of nets within an integrated physical synthesis syste...
FOCS
2005
IEEE
14 years 4 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...