Sciweavers

112 search results - page 6 / 23
» Quasi-interpretation Synthesis by Decomposition
Sort
View
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 1 months ago
Optimizing sequential cycles through Shannon decomposition and retiming
—Optimizing sequential cycles is essential for many types of high-performance circuits, such as pipelines for packet processing. Retiming is a powerful technique for speeding pip...
Cristian Soviani, Olivier Tardieu, Stephen A. Edwa...
DAC
1998
ACM
13 years 11 months ago
Compatible Class Encoding in Hyper-Function Decomposition for FPGA Synthesis
Recently, functional decomposition has been adopted for LUT based FPGA technology mapping with good results. In this paper, we propose a novel method for functional multipleoutput...
Jie-Hong Roland Jiang, Jing-Yang Jou, Juinn-Dar Hu...
ICIP
2005
IEEE
14 years 9 months ago
Tensor-based factor decomposition for relighting
Lighting condition is an important factor in face analysis and synthesis, which has received extensive study in both computer vision and computer graphics. Motivated by the work on...
Dahua Lin, Yingqing Xu, Xiaoou Tang, Shuicheng Yan
CVPR
2010
IEEE
14 years 3 months ago
Hierarchical Convolutional Sparse Image Decomposition
Building robust low and mid-level image representations, beyond edge primitives, is a long-standing goal in vision. Many existing feature detectors spatially pool edge information...
Matthew Zeiler, Dilip Krishnan, Graham Taylor, Rob...
ITCC
2002
IEEE
14 years 13 days ago
FSM Implementation in Embedded Memory Blocks of Programmable Logic Devices Using Functional Decomposition
: Since modern programmable devices contain embedded memory blocks, there exists a possibility to implement Finite State Machines (FSM) using such blocks. The size of the memory av...
Henry Selvaraj, Mariusz Rawski, Tadeusz Luba