Sciweavers

513 search results - page 53 / 103
» Reduction Transformations in ORM
Sort
View
ICPPW
2002
IEEE
15 years 4 months ago
Near-Optimal Loop Tiling by Means of Cache Miss Equations and Genetic Algorithms
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...
Jaume Abella, Antonio González, Josep Llosa...
CC
2000
Springer
135views System Software» more  CC 2000»
15 years 4 months ago
Fast Escape Analysis and Stack Allocation for Object-Based Programs
A fast and scalable interprocedural escape analysis algorithm is presented. The analysis computes a description of a subset of created objects whose lifetime is bounded by the life...
David Gay, Bjarne Steensgaard
AMAST
2006
Springer
15 years 3 months ago
The Substitution Vanishes
Abstract. Accumulation techniques were invented to transform functional programs, which intensively use append functions (like inefficient list reversal), into more efficient progr...
Armin Kühnemann, Andreas Maletti
BMVC
2002
15 years 2 months ago
Speed v. Accuracy for High Resolution Colour Texture Classification
Methods for extracting features and classifying textures in high resolution colour images are presented. The proposed features are directional texture features obtained from the c...
A. Monadjemi, Barry T. Thomas, Majid Mirmehdi
ICISC
2007
120views Cryptology» more  ICISC 2007»
15 years 1 months ago
Improving the Time Complexity of Matsui's Linear Cryptanalysis
This paper reports on an improvement of Matsui’s linear cryptanalysis that reduces the complexity of an attack with algorithm 2, by taking advantage of the Fast Fourier Transform...
Baudoin Collard, François-Xavier Standaert,...