Sciweavers

4110 search results - page 132 / 822
» Efficient algorithms for the 2-gathering problem
Sort
View
123
Voted
VLSID
2002
IEEE
160views VLSI» more  VLSID 2002»
16 years 4 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...
RECOMB
2005
Springer
16 years 4 months ago
Efficient Algorithms for Detecting Signaling Pathways in Protein Interaction Networks
Abstract. The interpretation of large-scale protein network data depends on our ability to identify significant sub-structures in the data, a computationally intensive task. Here w...
Jacob Scott, Trey Ideker, Richard M. Karp, Roded S...
TKDE
2008
136views more  TKDE 2008»
15 years 4 months ago
Efficient Correlation Search from Graph Databases
Correlation mining has gained great success in many application domains for its ability to capture underlying dependencies between objects. However, research on correlation mining ...
Yiping Ke, James Cheng, Wilfred Ng
CVPR
2010
IEEE
15 years 6 months ago
Compact Projection: Simple and Efficient Near Neighbor Search with Practical Memory Requirements
Image similarity search is a fundamental problem in computer vision. Efficient similarity search across large image databases depends critically on the availability of compact ima...
Kerui Min, Linjun Yang, John Wright, Lei Wu, Xian-...
ICCAD
2009
IEEE
151views Hardware» more  ICCAD 2009»
15 years 2 months ago
GREMA: Graph reduction based efficient mask assignment for double patterning technology
Double patterning technology (DPT) has emerged as the most hopeful candidate for the next technology node of the ITRS roadmap [1]. The goal of a DPT decomposer is to decompose the...
Yue Xu, Chris Chu