Sciweavers

1720 search results - page 60 / 344
» Evaluation of a High Performance Code Compression Method
Sort
View
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
15 years 6 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
DCOSS
2005
Springer
15 years 8 months ago
Routing Explicit Side Information for Data Compression in Wireless Sensor Networks
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
Huiyu Luo, Gregory J. Pottie
ICIP
2004
IEEE
16 years 4 months ago
Multidimensional signal compression using multi-scale recurrent patterns with smooth side-match criterion
The recently proposed method for image compression based on multi-scale recurrent patterns, the MMP (Multidimensional Multiscale Parser) has been shown to perform well for a large...
Eddie B. L. Filho, Murilo B. de Carvalho, Eduardo ...
ICIP
1999
IEEE
16 years 4 months ago
A Fast Segmentation Algorithm for Bi-Level Image Compression Using JBIG2
The emerging JBIG2 standard allows compliant encoders to achieve very high compression rates on bi-level images, especially when images are properly segmented into regions of line...
Dave A. D. Tompkins, Faouzi Kossentini
HIPEAC
2005
Springer
15 years 8 months ago
A Practical Method for Quickly Evaluating Program Optimizations
This article aims at making iterative optimization practical and usable by speeding up the evaluation of a large range of optimizations. Instead of using a full run to evaluate a s...
Grigori Fursin, Albert Cohen, Michael F. P. O'Boyl...