Sciweavers

313 search results - page 38 / 63
» Redundancy Elimination for LF
Sort
View
SIGSOFT
2007
ACM
16 years 16 days ago
Determining detailed structural correspondence for generalization tasks
Generalization tasks are important for continual improvement to the design of an evolving code base, eliminating redundancy where it has accumulated. An important step in generali...
Jörg Denzinger, Joseph J. C. Chang, Robert J....
DCC
2005
IEEE
15 years 11 months ago
Efficient Alphabet Partitioning Algorithms for Low-Complexity Entropy Coding
We analyze the technique for reducing the complexity of entropy coding consisting in the a priori grouping of the source alphabet symbols, and in dividing the coding process in tw...
Amir Said
ICDE
2010
IEEE
401views Database» more  ICDE 2010»
15 years 9 months ago
Continuous Query Evaluation over Distributed Sensor Networks
— In this paper1 we address the problem of processing continuous multi-join queries, over distributed data streams. Our approach makes use of existing work in the field of publi...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
DEBS
2009
ACM
15 years 6 months ago
Processing publish/subscribe queries over distributed data streams
We address the problem of processing continuous multi-join queries, over distributed data streams, making use of existing work in the field of publish/subscribe systems. We show ...
Oana Jurca, Sebastian Michel, Alexandre Herrmann, ...
ICC
2008
IEEE
123views Communications» more  ICC 2008»
15 years 6 months ago
A Simple Modulation Code with Peak Power Reduction and Coding Gain
Abstract— In this paper, a simple modulation code called symbol insertion for band-limited single-carrier systems is proposed. This code can reduce the peak-to-average power rati...
Makoto Tanahashi, Hideki Ochiai