5115 search results - page 146 / 1023 » On Randomized Lanczos Algorithms |
160
click to vote
WEA
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. The maximum diversity problem (MDP) consists of identifying optimally diverse subsets of elements from some larger collection. The selection of elements is based on the d...
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 ...