Sciweavers

7264 search results - page 136 / 1453
» A multiplicative up-propagation algorithm
Sort
View
135
Voted
DCC
1993
IEEE
15 years 8 months ago
Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding
Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
CSR
2006
Springer
15 years 8 months ago
Complexity of Polynomial Multiplication over Finite Fields
Let Mq (n ) denote the number of multiplications required to compute the coefficients of the product of two polynomials of degree n over a q -element field by means of bilinear alg...
Michael Kaminski
ICCS
2009
Springer
15 years 11 months ago
Fast Conjugate Gradients with Multiple GPUs
The limiting factor for efficiency of sparse linear solvers is the memory bandwidth. In this work, we utilize GPU’s high memory bandwidth for implementation of a sparse iterative...
Ali Cevahir, Akira Nukada, Satoshi Matsuoka
FSS
2007
117views more  FSS 2007»
15 years 4 months ago
Multiple regression with fuzzy data
In this paper, we propose an iterative algorithm for multiple regression with fuzzy variables.While using the standard least-squares criterion as a performance index, we pose the ...
Andrzej Bargiela, Witold Pedrycz, Tomoharu Nakashi...
ARITH
2007
IEEE
15 years 10 months ago
Fast Modular Reduction
It is widely acknowledged that efficient modular multiplication is a key to high-performance implementation of public-key cryptography, be it classical RSA, Diffie-Hellman, or (hy...
William Hasenplaugh, Gunnar Gaubatz, Vinodh Gopal