Sciweavers

1183 search results - page 115 / 237
» Efficient Wet Paper Codes
Sort
View
59
Voted
AMAST
2006
Springer
15 years 1 months ago
Data Movement Optimisation in Point-Free Form
Programs written in point-free form express computation purely in terms of functions. Such programs are especially amenable to local transformation. In this paper, we describe a pr...
Brad Alexander, Andrew L. Wendelborn
CORR
2008
Springer
58views Education» more  CORR 2008»
14 years 10 months ago
Tight Bounds on Minimum Maximum Pointwise Redundancy
This paper presents new lower and upper bounds for the optimal compression of binary prefix codes in terms of the most probable input symbol, where compression efficiency is determ...
Michael Baer
DCC
2006
IEEE
15 years 9 months ago
The B-coder: An Improved Binary Arithmetic Coder and Probability Estimator
In this paper we present the B-coder, an efficient binary arithmetic coder that performs extremely well on a wide range of data. The B-coder should be classed as an `approximate&#...
Benjamin Kelly, David F. Brailsford
IPPS
2002
IEEE
15 years 3 months ago
Real-Time Communication for Distributed Vision Processing Based on Imprecise Computation Model
In this paper we propose an efficient real-time communication mechanism for distributed vision processing. One of the biggest problems of distributed vision processing, as is the ...
Hiromasa Yoshimoto, Daisaku Arita, Rin-ichiro Tani...
POPL
1997
ACM
15 years 1 months ago
Parameterized Types for Java
Java offers the real possibility that most programs can be written in a type-safe language. However, for Java to be broadly useful, it needs additional expressive power. This pape...
Andrew C. Myers, Joseph A. Bank, Barbara Liskov