Sciweavers

971 search results - page 3 / 195
» Comparative Analysis of Arithmetic Coding Computational Comp...
Sort
View
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
12 years 7 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
ICASSP
2011
IEEE
12 years 11 months ago
Nonbinary LDPC decoding by min-sum with Adaptive Message Control
— A new decoding algorithm, referred to as Min-Sum with Adaptive Message Control (AMC-MS), is proposed to reduce the decoding complexity of nonbinary LDPC codes. The proposed alg...
Weiguo Tang, Jie Huang, Lei Wang, Shengli Zhou
SMA
2005
ACM
167views Solid Modeling» more  SMA 2005»
14 years 1 months ago
Boolean operations on 3D selective Nef complexes: optimized implementation and experiments
Nef polyhedra in d-dimensional space are the closure of half-spaces under boolean set operation. In consequence, they can represent non-manifold situations, open and closed sets, ...
Peter Hachenberger, Lutz Kettner
HPDC
1993
IEEE
13 years 12 months ago
An Analysis of Distributed Computing Software and Hardware for Applications in Computational Physics
We have implemented a set of computational physics codes on a network of IBM RS/6000 workstations used as a distributed parallel computer. We compare the performance of the codes ...
Paul D. Coddington
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
14 years 1 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...