Sciweavers

3750 search results - page 328 / 750
» Code Optimization for Code Compression
Sort
View
GLOBECOM
2009
IEEE
15 years 11 months ago
Multi-Functional Compression with Side Information
Abstract—In this paper, we consider the problem of multifunctional compression with side information. The problem is how we can compress a source X so that the receiver is able t...
Soheil Feizi-Khankandi, Muriel Médard
EMSOFT
2009
Springer
15 years 11 months ago
Adding aggressive error correction to a high-performance compressing flash file system
While NAND flash memories have rapidly increased in both capacity and performance and are increasingly used as a storage device in many embedded systems, their reliability has de...
Yangwook Kang, Ethan L. Miller
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
15 years 8 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
IPPS
2007
IEEE
15 years 11 months ago
Optimizing Sorting with Machine Learning Algorithms
The growing complexity of modern processors has made the development of highly efficient code increasingly difficult. Manually developing highly efficient code is usually expen...
Xiaoming Li, María Jesús Garzar&aacu...
DCC
2008
IEEE
16 years 4 months ago
High-Resolution Functional Quantization
Suppose a function of N real source variables XN 1 = (X1, X2, . . . , XN ) is desired at a destination constrained to receive a limited number of bits. If the result of evaluating...
Vinith Misra, Vivek K. Goyal, Lav R. Varshney