5153 search results - page 154 / 1031 » Introduction to Randomized Algorithms |
190
click to vote
COCO
1991
Springer
15 years 10 months ago
1991
Springer
Abstract. In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for a...
171
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW]...
181
click to vote
ICDM
2007
IEEE
15 years 8 months ago
2007
IEEE
For applications with consecutive incoming training examples, on-line learning has the potential to achieve a likelihood as high as off-line learning without scanning all availabl...
151
click to vote
TIT
2008
15 years 6 months ago
2008
This paper presents a quasi-random approach to space-time (ST) codes. The basic principle is conceptually simple, yet still very effective and flexible regarding the transmission ...
272
click to vote
CIARP
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we report an approach for cryptographic key generation based on keystroke dynamics and the k-medoids algorithm. The stages that comprise the approach are training-enr...