Sciweavers

112 search results - page 13 / 23
» Quasi-interpretation Synthesis by Decomposition
Sort
View
FPGA
1997
ACM
120views FPGA» more  FPGA 1997»
13 years 11 months ago
Partially-Dependent Functional Decomposition with Applications in FPGA Synthesis and Mapping
In this paper, we give a necessary and sufficient condition for the existence of partially-dependent functional decomposition and develop new algorithms to compute such decomposi...
Jason Cong, Yean-Yow Hwang
JSS
2008
136views more  JSS 2008»
13 years 7 months ago
Specification, decomposition and agent synthesis for situation-aware service-based systems
Service-based systems are distributed computing systems with the major advantage of enabling rapid composition of distributed applications, such as collaborative research and deve...
Stephen S. Yau, Haishan Gong, Dazhi Huang, Wei Gao...
DAC
2009
ACM
14 years 8 months ago
Timing-driven optimization using lookahead logic circuits
This paper describes a function-based timing-driven optimization technique for the synthesis of multi-level logic circuits. Motivated by the principles of parallel prefix computat...
Mihir R. Choudhury, Kartik Mohanram
SIAMIS
2011
13 years 2 months ago
Locally Parallel Texture Modeling
This article presents a new adaptive framework for locally parallel texture modeling. Oscillating patterns are modeled with functionals that constrain the local Fourier decompositi...
Pierre Maurel, Jean-François Aujol, Gabriel...