Sciweavers

3750 search results - page 504 / 750
» Code Optimization for Code Compression
Sort
View
PC
2002
82views Management» more  PC 2002»
15 years 3 months ago
Time-minimal tiling when rise is larger than zero
This paper presents a solution to the open problem of finding the optimal tile size to minimise the execution time of a parallelogram-shaped iteration space on a distributed memory...
Jingling Xue, Wentong Cai
108
Voted
ICIP
2010
IEEE
15 years 1 months ago
Image quantization under spatial smoothness constraints
Quantization, defined as the act of attributing a finite number of grey-levels to an image, is an essential task in image acquisition and coding. It is also intricately linked to ...
Anna Jezierska, Caroline Chaux, Hugues Talbot, Jea...
250
Voted
DCC
2011
IEEE
14 years 11 months ago
Scalar Quantization for Relative Error
Quantizers for probabilistic sources are usually optimized for mean-squared error. In many applications, maintaining low relative error is a more suitable objective. This measure ...
John Z. Sun, Vivek K. Goyal
ICS
2009
Tsinghua U.
15 years 10 months ago
Parametric multi-level tiling of imperfectly nested loops
Tiling is a crucial loop transformation for generating high performance code on modern architectures. Efficient generation of multilevel tiled code is essential for maximizing da...
Albert Hartono, Muthu Manikandan Baskaran, C&eacut...
IEEEPACT
2008
IEEE
15 years 10 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy