Sciweavers

10 search results - page 1 / 2
» Internal Compression of Protocols to Entropy
Sort
View
ISVC
2009
Springer
13 years 11 months ago
Image Compression Based on Visual Saliency at Individual Scales
5th International Symposium on Visual Computing, Las Vegas, Nevada, USA, Nov 30 - Dec 2, 2009 The goal of lossy image compression ought to be reducing entropy while preserving the...
Stella X. Yu, Dimitri A. Lisin
ICALP
2003
Springer
13 years 10 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
MOBICOM
2000
ACM
13 years 8 months ago
A unified header compression framework for low-bandwidth links
Compressing protocol headers has traditionally been an attractive way of conserving bandwidth over low-speed links, including those in wireless systems. However, despite the growt...
Jeremy Lilley, Jason Yang, Hari Balakrishnan, Srin...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 8 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
BMCBI
2010
132views more  BMCBI 2010»
13 years 4 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...