Sciweavers

337 search results - page 1 / 68
» A Steiner Tree approach to efficient object detection
Sort
View
CVPR
2010
IEEE
14 years 24 days 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
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
14 years 5 months ago
An Efficient Hierarchical Timing-Driven Steiner Tree Algorithm for Global Routing
In this paper, we propose a hierarchical timing-driven Steiner tree algorithm for global routing which considers the minimization of timing delay during the tree construction as t...
Jingyu Xu, Xianlong Hong, Tong Jing, Yici Cai, Jun...
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 6 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
ICCAD
2010
IEEE
229views Hardware» more  ICCAD 2010»
13 years 2 months ago
Obstacle-avoiding rectilinear Steiner minimum tree construction: An optimal approach
In this paper, we present an efficient method to solve the obstacle-avoiding rectilinear Steiner minimum tree (OARSMT) problem optimally. Our work is a major improvement over the w...
Tao Huang, Evangeline F. Y. Young
GLVLSI
2003
IEEE
177views VLSI» more  GLVLSI 2003»
13 years 10 months ago
Congestion reduction in traditional and new routing architectures
In dense integrated circuit designs, management of routing congestion is essential; an over congested design may be unroutable. Many factors influence congestion: placement, rout...
Ameya R. Agnihotri, Patrick H. Madden