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 ...
Abstract: Hybrid-redundant number representation has provided a flexible framework for digitparallel addition in a manner that facilitates area-time tradeoffs for VLSI implementati...
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 ...
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....
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...