Sciweavers

385 search results - page 21 / 77
» Code Compression Using Variable-to-fixed Coding Based on Ari...
Sort
View
VMV
2004
150views Visualization» more  VMV 2004»
13 years 10 months ago
Hierarchical Shape-Adaptive Quantization for Geometry Compression
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...
Stefan Gumhold
AMAST
2008
Springer
13 years 10 months ago
Vx86: x86 Assembler Simulated in C Powered by Automated Theorem Proving
Abstract. Vx86 is the first static analyzer for sequential Intel x86 assembler code using automated deductive verification. It proves the correctness of assembler code against func...
Stefan Maus, Michal Moskal, Wolfram Schulte
ICC
2007
IEEE
117views Communications» more  ICC 2007»
14 years 3 months ago
Comparing Different Transmission Strategies Using Turbo Codes for Nonuniform Memoryless Sources
— Nonuniform sources can be found in real world applications as uncompressed speech, text and medical images. In this paper we compare the performance of three different methods ...
Gilberto Titericz Jr., Richard Demo Souza, Javier ...
IJCNN
2008
IEEE
14 years 3 months ago
Efficient and low-complexity image coding with the lifting scheme and modified SPIHT
—In this paper, we propose an efficient and low complexity image coding algorithm based on the lifting wavelet transform and listless modified SPIHT (LWT-LMSPIHT). LWT-LMSPIHT jo...
Hong Pan, Wan-Chi Siu, Ngai-Fong Law
ECCC
2010
79views more  ECCC 2010»
13 years 8 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