Sciweavers

23 search results - page 2 / 5
» Approximating Transitive Reductions for Directed Networks
Sort
View
DATE
2000
IEEE
128views Hardware» more  DATE 2000»
13 years 9 months ago
A Bus Delay Reduction Technique Considering Crosstalk
As the CMOS technology scaled down, the horizontal coupling capacitance between adjacent wires plays dominant part in wire load, crosstalk interference becomes a serious problem f...
Kei Hirose, Hiroto Yasuura
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
13 years 7 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
DAC
2005
ACM
13 years 7 months ago
Piece-wise approximations of RLCK circuit responses using moment matching
Capturing RLCK circuit responses accurately with existing model order reduction (MOR) techniques is very expensive. Direct metrics for fast analysis of RC circuits exist but there...
Chirayu S. Amin, Yehea I. Ismail, Florentin Dartu
WABI
2007
Springer
109views Bioinformatics» more  WABI 2007»
13 years 11 months ago
A Novel Method for Signal Transduction Network Inference from Indirect Experimental Evidence
In this paper we introduce a new method of combined synthesis and inference of biological signal transduction networks. A main idea of our method lies in representing observed cau...
Réka Albert, Bhaskar DasGupta, Riccardo Don...
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
14 years 2 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan