1945 search results - page 184 / 389 » Speeding up Serpent |
186
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Nonnegative Matrix Factorization (NMF) is the problem of approximating a nonnegative matrix with the product of two low-rank nonnegative matrices and has been shown to be particul...
151
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
179
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
147
click to vote
ACTAC
2006
15 years 6 months ago
2006
In speech recognition vast hypothesis spaces are generated, so the search methods used and their speedup techniques are both of great importance. One way of getting a speedup gain...
154
click to vote
IEICET
2008
15 years 6 months ago
2008
For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with k = 9 or curves w...