Sciweavers

4 search results - page 1 / 1
» Spatial complexity of reversibly computable DAG
Sort
View
CASES
2009
ACM
13 years 2 months ago
Spatial complexity of reversibly computable DAG
In this paper we address the issue of making a program reversible in terms of spatial complexity. Spatial complexity is the amount of memory/register locations required for perfor...
Mouad Bahi, Christine Eisenbeis
ICIP
2009
IEEE
14 years 5 months ago
3d Medical Image Compression Based On Multiplierless Low-complexity Rklt And Shape-adaptive Wavelet Transform
A multiplier-less low complexity reversible integer Karhunen-Lo?ve transform (Low-RKLT) is proposed based on multi-lifting. Conventional methods based on KLT suffer from high comp...
JSA
2000
115views more  JSA 2000»
13 years 4 months ago
Scheduling optimization through iterative refinement
Scheduling DAGs with communication times is the theoretical basis for achieving efficient parallelism on distributed memory systems. We generalize Graham's task-level in a ma...
Mayez A. Al-Mouhamed, Adel Al-Massarani
SIAMSC
2008
131views more  SIAMSC 2008»
13 years 4 months ago
Fast Monte Carlo Simulation Methods for Biological Reaction-Diffusion Systems in Solution and on Surfaces
Many important physiological processes operate at time and space scales far beyond those accessible to atom-realistic simulations, and yet discrete stochastic rather than continuum...
Rex A. Kerr, Thomas M. Bartol, Boris Kaminsky, Mar...