Sciweavers

269 search results - page 38 / 54
» Improved Local Coordinate Coding using Local Tangents
Sort
View
ICPP
1999
IEEE
14 years 7 days ago
Compiler Optimizations for I/O-Intensive Computations
This paper describes transformation techniques for out-of-core programs (i.e., those that deal with very large quantities of data) based on exploiting locality using a combination...
Mahmut T. Kandemir, Alok N. Choudhary, J. Ramanuja...
CGO
2004
IEEE
13 years 11 months ago
A Compiler Scheme for Reusing Intermediate Computation Results
Recent research has shown that programs often exhibit value locality. Such locality occurs when a code segment, although executed repeatedly in the program, takes only a small num...
Yonghua Ding, Zhiyuan Li
ESAS
2007
Springer
14 years 2 months ago
Distance Bounding in Noisy Environments
Location information can be used to enhance mutual entity authentication protocols in wireless ad-hoc networks. More specifically, distance bounding protocols have been introduced...
Dave Singelée, Bart Preneel
CC
2001
Springer
103views System Software» more  CC 2001»
14 years 14 days ago
Design-Driven Compilation
This paper introduces design-driven compilation, an approach in which the compiler uses design information to drive its analysis and verify that the program conforms to its design....
Radu Rugina, Martin C. Rinard
TIP
2010
357views more  TIP 2010»
13 years 6 months ago
Efficient Compression of Encrypted Grayscale Images
—Lossless compression of encrypted sources can be achieved through Slepian-Wolf coding. For encrypted real-world sources such as images, the key to improve the compression effici...
Wei Liu, Wenjun Zeng, Lina Dong, Qiuming Yao