Sciweavers

567 search results - page 36 / 114
» Decomposing replicable functions
Sort
View
ICCAD
2008
IEEE
140views Hardware» more  ICCAD 2008»
15 years 6 months ago
To SAT or not to SAT: Ashenhurst decomposition in a large scale
Functional decomposition is a fundamental operation in logic synthesis. Prior BDD-based approaches to functional decomposition suffer from the memory explosion problem and do not...
Hsuan-Po Lin, Jie-Hong Roland Jiang, Ruei-Rung Lee
SERP
2004
14 years 11 months ago
Using Clustering Technique to Restructure Programs
Program restructuring or refactoring is often required when a function becomes too large or is involved in multiple activities and therefore exhibits low cohesion. A critical fact...
Chung-Horng Lung, Marzia Zaman
81
Voted
ICCV
2009
IEEE
16 years 2 months ago
Segmentation and Shading Estimation in Slowly Changing Textured Images
We present a novel representation for modeling textured regions subject to smooth variations in orientation and scale. Utilizing the steerable pyramid of Simoncelli and Freeman ...
Jason Chang, John W. Fisher III
ASPDAC
2006
ACM
107views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Jitter decomposition in ring oscillators
Abstract— It is important to separate random jitter from deterministic jitter to quantify their contributions to the total jitter. This paper identifies the limitations of the e...
Qingqi Dou, Jacob A. Abraham
SOFSEM
2005
Springer
15 years 3 months ago
Characteristic Patterns for LTL
We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings...
Antonín Kucera, Jan Strejcek