Sciweavers

184 search results - page 16 / 37
» Timing budgeting under arbitrary process variations
Sort
View
129
Voted
HASE
2007
IEEE
15 years 10 months ago
Scalable, Adaptive, Time-Bounded Node Failure Detection
This paper presents a scalable, adaptive and timebounded general approach to assure reliable, real-time Node-Failure Detection (NFD) for large-scale, high load networks comprised ...
Matthew Gillen, Kurt Rohloff, Prakash Manghwani, R...
125
Voted
ASPDAC
2010
ACM
135views Hardware» more  ASPDAC 2010»
15 years 1 months ago
Statistical timing verification for transparently latched circuits through structural graph traversal
Level-sensitive transparent latches are widely used in high-performance sequential circuit designs. Under process variations, the timing of a transparently latched circuit will ada...
Xingliang Yuan, Jia Wang
95
Voted
SIAMNUM
2010
106views more  SIAMNUM 2010»
14 years 10 months ago
Computing Sacker-Sell spectra in Discrete Time Dynamical Systems
In this paper we develop boundary value methods for detecting Sacker-Sell spectra in discrete time dynamical systems. The algorithms are advancements of earlier methods for comput...
Thorsten Hüls
132
Voted
ICIP
2004
IEEE
16 years 5 months ago
Background modeling and subtraction by codebook construction
We present a new fast algorithm for background modeling and subtraction. Sample background values at each pixel are quantized into codebooks which represent a compressed form of b...
Kyungnam Kim, Thanarat H. Chalidabhongse, David Ha...
148
Voted
BMCBI
2010
156views more  BMCBI 2010»
15 years 3 months ago
Extended morphological processing: a practical method for automatic spot detection of biological markers from microscopic images
Background: A reliable extraction technique for resolving multiple spots in light or electron microscopic images is essential in investigations of the spatial distribution and dyn...
Yoshitaka Kimori, Norio Baba, Nobuhiro Morone