Sciweavers

544 search results - page 41 / 109
» On the Complexity of Loop Fusion
Sort
View
APLAS
2005
ACM
14 years 2 months ago
Transformation to Dynamic Single Assignment Using a Simple Data Flow Analysis
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...
Peter Vanbroekhoven, Gerda Janssens, Maurice Bruyn...
SCP
2011
305views Communications» more  SCP 2011»
13 years 3 months ago
DESOLA: An active linear algebra library using delayed evaluation and runtime code generation
Active libraries can be defined as libraries which play an active part in the compilation, in particular, the optimisation of their client code. This paper explores the implement...
Francis P. Russell, Michael R. Mellor, Paul H. J. ...
JAPLL
2006
97views more  JAPLL 2006»
13 years 9 months ago
Model checking propositional dynamic logic with all extras
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
Martin Lange
ICIP
2007
IEEE
14 years 3 months ago
Complexity Control for Real-Time Video Coding
A methodology for complexity scalable video encoding and complexity control within the framework of the H.264/AVC video encoder is presented. To yield good rate-distortion perform...
Emrah Akyol, Debargha Mukherjee, Yuxin Liu
DATE
2007
IEEE
150views Hardware» more  DATE 2007»
14 years 3 months ago
Fast memory footprint estimation based on maximal dependency vector calculation
In data dominated applications, loop transformations have a huge impact on the lifetime of array data and therefore on memory footprint. Since a locally optimal loop transformatio...
Qubo Hu, Arnout Vandecappelle, Per Gunnar Kjeldsbe...