Sciweavers

274 search results - page 42 / 55
» Program Compression
Sort
View
DCC
2005
IEEE
14 years 7 months ago
Towards Practical Minimum-Entropy Universal Decoding
Minimum-entropy decoding is a universal decoding algorithm used in decoding block compression of discrete memoryless sources as well as block transmission of information across di...
Todd P. Coleman, Muriel Médard, Michelle Ef...
SOSP
2001
ACM
14 years 4 months ago
A Low-Bandwidth Network File System
Users rarely consider running network file systems over slow or wide-area networks, as the performance would be unacceptable and the bandwidth consumption too high. Nonetheless, ...
Athicha Muthitacharoen, Benjie Chen, David Mazi&eg...
LCTRTS
2005
Springer
14 years 29 days ago
System-wide compaction and specialization of the linux kernel
The limited built-in configurability of Linux can lead to expensive code size overhead when it is used in the embedded market. To overcome this problem, we propose the applicatio...
Dominique Chanet, Bjorn De Sutter, Bruno De Bus, L...
PPOPP
2003
ACM
14 years 22 days ago
The design and implementation of a parallel array operator for the arbitrary remapping of data
Gather and scatter are data redistribution functions of longstanding importance to high performance computing. In this paper, we present a highly-general array operator with power...
Steven J. Deitz, Bradford L. Chamberlain, Sung-Eun...
ICALP
2007
Springer
13 years 11 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan