12289 search results - page 496 / 2458 » computing 2006 |
146
click to vote
RSA
2006
15 years 6 months ago
2006
Limit theorems (including a Berry-Esseen bound) are derived for the number of comparisons taken by the Boyer-Moore algorithm for finding the occurrences of a given pattern in a ra...
151
click to vote
EJC
2006
15 years 6 months ago
2006
We apply Computational Algebra methods to the construction of Hadamard matrices with two circulant cores, given by Fletcher, Gysin and Seberry. We introduce the concept of Hadamar...
176
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
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...
187
click to vote
EGITALY
2006
15 years 8 months ago
2006
These latest years witnessed an impressive improvement of graphics hardware both in terms of features and in terms of computational power. This improvement can be easily observed ...
156
click to vote
JSAC
1998
15 years 6 months ago
1998
Abstract—The excellent bit error rate performance of new iterative decoding algorithms (e.g., turbodecoding) is achieved at the expense of a computationally burdensome decoding p...