721 search results - page 51 / 145 » On Generators of Random Quasigroup Problems |
CRYPTO
2004
Springer
14 years 1 months ago
2004
Springer
We study cryptographic attacks on random Feistel schemes. We denote by m the number of plaintext/ciphertext pairs, and by k the number of rounds. In their famous paper [3], M. Luby...
AUSAI
2005
Springer
14 years 1 months ago
2005
Springer
This paper considers the use of randomly generated directed graphs as neighborhoods for particle swarm optimizers (PSO) using fully informed particles (FIPS), together with dynamic...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
—This paper presents an alternative formulation for the Bayesian feature-based simultaneous localisation and mapping (SLAM) problem, using a random finite set approach. For a fe...
CVIU
2007
13 years 8 months ago
2007
We investigate the problem of automatically creating 3D models of man-made environments that we represent as collections of textured planes. A typical approach is to automatically...