Sciweavers

4469 search results - page 176 / 894
» Dynamic Program Slicing
Sort
View
FPGA
2010
ACM
243views FPGA» more  FPGA 2010»
14 years 4 months ago
Bit-level optimization for high-level synthesis and FPGA-based acceleration
d hardware design from behavior-level abstraction has drawn wide interest in FPGA-based acceleration and configurable computing research field. However, for many high-level progra...
Jiyu Zhang, Zhiru Zhang, Sheng Zhou, Mingxing Tan,...
FCT
2005
Springer
14 years 1 months ago
On the Incompressibility of Monotone DNFs
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
Matthias P. Krieger
WCRE
2000
IEEE
14 years 11 days ago
Revisiting the Delta IC Approach to Component Recovery
Component recovery supports program understanding, architecture recovery, and re-use. Among the best known techniques for detection of re-usable objects (related global variables ...
Gerardo Canfora, Jörg Czeranski, Rainer Kosch...
VISUALIZATION
1993
IEEE
14 years 3 days ago
Visualization of Time-Dependent Flow Fields
We present an interactive visualization approach for the dense representation of unsteady 3D flow fields. The first part of this approach is a GPU-based 3D texture advection schem...
David A. Lane
CONCUR
1993
Springer
14 years 3 days ago
Loop Parallelization in the Polytope Model
During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is r...
Christian Lengauer