Sciweavers

370 search results - page 1 / 74
» Statistical static timing analysis: how simple can we get
Sort
View
DAC
2005
ACM
14 years 5 months ago
Statistical static timing analysis: how simple can we get?
Chirayu S. Amin, Noel Menezes, Kip Killpack, Flore...
DAC
2005
ACM
13 years 6 months ago
How accurately can we model timing in a placement engine?
This paper presents a novel placement algorithm for timing optimization based on a new and powerful concept, which we term differential timing analysis. Recognizing that accurate ...
Amit Chowdhary, Karthik Rajagopal, Satish Venkates...
CVPR
2009
IEEE
1096views Computer Vision» more  CVPR 2009»
14 years 11 months ago
How far can you get with a modern face recognition test set using only simple features?
In recent years, large databases of natural images have become increasingly popular in the evaluation of face and object recognition algorithms. However, Pinto et al. previously ...
Nicolas Pinto, James J. DiCarlo, David D. Cox
ICCAD
2008
IEEE
125views Hardware» more  ICCAD 2008»
14 years 1 months ago
Practical, fast Monte Carlo statistical static timing analysis: why and how
Statistical static timing analysis (SSTA) has emerged as an essential tool for nanoscale designs. Monte Carlo methods are universally employed to validate the accuracy of the appr...
Amith Singhee, Sonia Singhal, Rob A. Rutenbar
ICIP
2002
IEEE
14 years 6 months ago
How a simple shift can significantly improve the performance of linear interpolation
We present a simple, original method to improve piecewise linear interpolation with uniform knots: We shift the sampling knots by a fixed amount, while enforcing the interpolation...
Michael Unser, Philippe Thévenaz, Thierry B...