Sciweavers

1508 search results - page 21 / 302
» Efficient Path Profiling
Sort
View
TKDE
2002
239views more  TKDE 2002»
13 years 9 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
DATE
1999
IEEE
147views Hardware» more  DATE 1999»
14 years 2 months ago
Efficient BIST Hardware Insertion with Low Test Application Time for Synthesized Data Paths
In this paper, new and efficient BIST methodology and BIST hardware insertion algorithms are presented for RTL data paths obtained from high level synthesis. The methodology is ba...
Nicola Nicolici, Bashir M. Al-Hashimi
DAC
2002
ACM
14 years 10 months ago
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
We propose a false-path-aware statistical timing analysis framework. In our framework, cell as well as interconnect delays are assumed to be correlated random variables. Our tool ...
Jing-Jia Liou, Angela Krstic, Li-C. Wang, Kwang-Ti...
ASPDAC
2007
ACM
105views Hardware» more  ASPDAC 2007»
14 years 1 months ago
An Efficient Computation of Statistically Critical Sequential Paths Under Retiming
Abstract-- In this paper we present the Statistical Retimingbased Timing Analysis (SRTA) algorithm. The goal is to compute the timing slack distribution for the nodes in the timing...
Mongkol Ekpanyapong, Xin Zhao, Sung Kyu Lim
JCNS
2010
103views more  JCNS 2010»
13 years 4 months ago
Efficient computation of the maximum a posteriori path and parameter estimation in integrate-and-fire and more general state-spa
A number of important data analysis problems in neuroscience can be solved using state-space models. In this article, we describe fast methods for computing the exact maximum a pos...
Shinsuke Koyama, Liam Paninski