5115 search results - page 270 / 1023 » On Randomized Lanczos Algorithms |
155
click to vote
ASIACRYPT
2003
Springer
16 years 13 days ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
189
click to vote
CIE
2010
Springer
15 years 11 months ago
2010
Springer
In the theory of algorithmic randomness, one of the central notions is that of computable randomness. An infinite binary sequence X is computably random if no recursive martingale...
185
click to vote
AAIM
2006
Springer
16 years 1 months ago
2006
Springer
We introduce a novel invertible transform for two-dimensional data which has the objective of reordering the matrix so it will improve its (lossless) compression at later stages. T...
207
click to vote
APPROX
1998
Springer
15 years 11 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
178
click to vote
FOCS
2004
IEEE
15 years 11 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...