Sciweavers

314 search results - page 32 / 63
» Arithmetic Coding Revisited
Sort
View
ECCC
2010
79views more  ECCC 2010»
14 years 10 months ago
IP = PSPACE using Error Correcting Codes
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...
Or Meir
INTEGRATION
2008
191views more  INTEGRATION 2008»
14 years 9 months ago
Constant-time addition with hybrid-redundant numbers: Theory and implementations
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
Ghassem Jaberipur, Behrooz Parhami
ICIP
2001
IEEE
15 years 11 months ago
A flexible polygon representation of multiple overlapping regions of interest for wavelet-based image coding
Image transmission over low-bandwidth channels can be speeded up if the image coding mechanism supports regions of interest (RoIs). By such a scheme, image parts not belonging to ...
Heidrun Schumann, René Rosenbaum, Uwe Rausc...
FSEN
2007
Springer
15 years 4 months ago
Hoare Logic for ARM Machine Code
This paper shows how a machine-code Hoare logic is used to lift reasoning from the tedious operational model of a machine lana manageable level of abstraction without making simpli...
Magnus O. Myreen, Anthony C. J. Fox, Michael J. C....
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
15 years 3 months ago
A New Bit-Plane Entropy Coder for Scalable Image Coding
Compression ratio and computational complexity are two major factors for a successful image coder. By exploring the Laplacian distribution of the wavelet coefficients, a new bit ...
Rong Zhang, Rongshan Yu, Qibin Sun, Wai-Choong Won...