Sciweavers

666 search results - page 22 / 134
» New primal-dual algorithms for Steiner tree problems
Sort
View
DAC
1998
ACM
14 years 2 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
ESA
2009
Springer
144views Algorithms» more  ESA 2009»
14 years 4 months ago
Narrow-Shallow-Low-Light Trees with and without Steiner Points
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
Michael Elkin, Shay Solomon
CVPR
2010
IEEE
14 years 6 months ago
A Steiner Tree approach to efficient object detection
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 ...
Olga Russakovsky, Quoc Le, Andrew Ng
ISPD
2003
ACM
88views Hardware» more  ISPD 2003»
14 years 3 months ago
Porosity aware buffered steiner tree construction
— 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...
Charles J. Alpert, Gopal Gandham, Milos Hrkic, Jia...
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
14 years 2 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
Cheng-Kok Koh, Patrick H. Madden