590 search results - page 43 / 118 » Resolution-stationary random number generators |
124
click to vote
FOCS
2007
IEEE
15 years 10 months ago
2007
IEEE
We show that every construction of one-time signature schemes from a random oracle achieves black-box security at most 2(1+o(1))q , where q is the total number of oracle queries a...
147
click to vote
CISC
2007
Springer
15 years 10 months ago
2007
Springer
We propose the idea of building a secure hash using quadratic or higher degree multivariate polynomials over a finite field as the compression function. We analyze some security ...
108
click to vote
ICIP
2006
IEEE
15 years 10 months ago
2006
IEEE
Compressive sampling (CS), or “Compressed Sensing,” has recently generated a tremendous amount of excitement in the image processing community. CS involves taking a relatively...
119
click to vote
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— We present an anytime algorithm for planning paths through high-dimensional, non-uniform cost search spaces. Our approach works by generating a series of Rapidly-exploring Rand...
139
click to vote
CEC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...