5115 search results - page 271 / 1023 » On Randomized Lanczos Algorithms |
224
click to vote
ESANN
2004
15 years 8 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
199
click to vote
JCPHY
2011
14 years 10 months ago
2011
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
208
click to vote
STACS
2012
Springer
14 years 2 months ago
2012
Springer
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
170
click to vote
ICMLA
2008
15 years 8 months ago
2008
Using decision trees that split on randomly selected attributes is one way to increase the diversity within an ensemble of decision trees. Another approach increases diversity by ...
189
click to vote
ICPP
1995
IEEE
15 years 10 months ago
1995
IEEE
In this paper we study the problems of sorting and selection on the Distributed Memory Bus Computer (DMBC) recently introduced by Sahni. In particular we present: 1) An efficient a...