Sciweavers

6045 search results - page 189 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DATE
2007
IEEE
130views Hardware» more  DATE 2007»
14 years 2 months ago
A novel criticality computation method in statistical timing analysis
Abstract— The impact of process variations increases as technology scales to nanometer region. Under large process variations, the path and arc/node criticality [18] provide effe...
Feng Wang 0004, Yuan Xie, Hai Ju
TIME
2006
IEEE
14 years 2 months ago
In time alone: on the computational power of querying the history
Querying its own history is an important mechanism in the computations, especially those interacting with people or other computations such as transaction processing, electronic d...
Alexei Lisitsa, Igor Potapov
RTCSA
2000
IEEE
14 years 18 days ago
Optimal scheduling of imprecise computation tasks in the presence of multiple faults
With the advance of applications such as multimedia, imagelspeech processing and real-time AI, real-time computing models allowing to express the “timeliness versus precision”...
Hakan Aydin, Rami G. Melhem, Daniel Mossé
ICIP
2001
IEEE
14 years 9 months ago
New algorithms for computing directional discrete Fourier transforms
New algorithms for computing the Discrete Fourier Transform (DFT) spectra along different directions are derived and implemented. For computing the DFT spectrum along any given di...
Marios S. Pattichis, Ruhai Zhou, Balaji Raman 0002
DATE
2003
IEEE
99views Hardware» more  DATE 2003»
14 years 1 months ago
Fast Computation of Data Correlation Using BDDs
Data correlation is a well-known problem that causes difficulty in VLSI testing. Based on a correlation metric, an efficient heuristic to select BIST registers has been proposed...
Zhihong Zeng, Qiushuang Zhang, Ian G. Harris, Maci...