5115 search results - page 88 / 1023 » On Randomized Lanczos Algorithms |
144
click to vote
STOC
2012
ACM
13 years 2 months ago
2012
ACM
We consider the problem of computing the k-sparse approximation to the discrete Fourier transform of an ndimensional signal. We show: • An O(k log n)-time randomized algorithm f...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We benchmark the pure random search algorithm on the BBOB 2009 noise-free testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space di...
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We benchmark the Pure-Random-Search algorithm on the BBOB 2009 noisy testbed. Each candidate solution is sampled uniformly in [−5, 5]D , where D denotes the search space dimensi...
SSDBM
1990
IEEE
15 years 3 months ago
1990
IEEE
In this paper we survey known results on algorithms, data structures, and some applications of random sampling from databases. We first discuss various reasons for sampling from d...
RSA
2006
14 years 11 months ago
2006
: On input a random 3-CNF formula of clauses-to-variables ratio r3 applies repeatedly the following simple heuristic: Set to True a literal that appears in the maximum number of cl...