Sciweavers

1448 search results - page 29 / 290
» From Requirements to Code Revisited
Sort
View
HPDC
2003
IEEE
14 years 29 days ago
RUMR: Robust Scheduling for Divisible Workloads
Divisible workload applications arise in many fields of science and engineering. They can be parallelized in master-worker fashion and relevant scheduling strategies have been pr...
Yang Yang, Henri Casanova
DCC
1996
IEEE
13 years 12 months ago
On the Implementation of Minimum-Redundancy Prefix Codes
Abstract--Minimum redundancy coding (also known as Huffman coding) is one of the enduring techniques of data compression. Many efforts have been made to improve the efficiency of m...
Alistair Moffat, Andrew Turpin
SENSYS
2003
ACM
14 years 27 days ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
ALT
2010
Springer
13 years 9 months ago
Learning without Coding
Abstract. Iterative learning is a model of language learning from positive data, due to Wiehagen. When compared to a learner in Gold's original model of language learning from...
Samuel E. Moelius, Sandra Zilles
ICIP
2002
IEEE
14 years 9 months ago
Dirty-paper trellis codes for watermarking
Informed coding is the practice of representing watermark messages with patterns that are dependent on the cover Works. This requires the use of a dirty-paper code, in which each ...
Gwenaël J. Doërr, Ingemar J. Cox, Matthe...