Sciweavers

309 search results - page 28 / 62
» Code Transformations for One-Pass Analysis
Sort
View
TCSV
2008
94views more  TCSV 2008»
15 years 2 months ago
FGS Coding Using Cycle-Based Leaky Prediction Through Multiple Leaky Factors
This paper proposes a fine granularity scalable (FGS) coding using cycle-based leaky prediction, in which the multiple leaky factors are used to yield enhancement layer prediction ...
Xiangyang Ji, Yanyan Zheng, Debin Zhao, Feng Wu, W...
DCC
2009
IEEE
16 years 3 months ago
Clustered Reversible-KLT for Progressive Lossy-to-Lossless 3d Image Coding
The RKLT is a lossless approximation to the KLT, and has been recently employed for progressive lossy-to-lossless coding of hyperspectral images. Both yield very good coding perfo...
Ian Blanes, Joan Serra-Sagristà
CASES
2006
ACM
15 years 8 months ago
A dynamic code placement technique for scratchpad memory using postpass optimization
In this paper, we propose a fully automatic dynamic scratchpad memory (SPM) management technique for instructions. Our technique loads required code segments into the SPM on deman...
Bernhard Egger, Chihun Kim, Choonki Jang, Yoonsung...
PASTE
1998
ACM
15 years 6 months ago
OPTVIEW: A New Approach for Examining Optimized Code
The task of mappingbetween source programs and machine code, once the code has been optimizedand transformed by a compiler is often di cult. Yet there are many instances, such as ...
Caroline Tice, Susan L. Graham
SODA
2008
ACM
144views Algorithms» more  SODA 2008»
15 years 3 months ago
Fast dimension reduction using Rademacher series on dual BCH codes
The Fast Johnson-Lindenstrauss Transform (FJLT) was recently discovered by Ailon and Chazelle as a novel technique for performing fast dimension reduction with small distortion fr...
Nir Ailon, Edo Liberty