5115 search results - page 145 / 1023 » On Randomized Lanczos Algorithms |
178
click to vote
PDCAT
2007
Springer
16 years 15 days ago
2007
Springer
ct There have been many previous attempts to accelerate MT19937 using FPGAs but we believe that we can substantially improve the previous implementations to develop a higher throug...
131
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
154
click to vote
ICS
1998
Tsinghua U.
15 years 10 months ago
1998
Tsinghua U.
Parallel computers are now commonly used for computational science and engineering, and many applications in these areas use random number generators. For some applications, such ...
159
click to vote
ICDM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents interpretations for association rules. It first introduces Pawlak’s method, and the corresponding algorithm of finding decision rules (a kind of association ...
151
click to vote
ESA
2001
Springer
15 years 11 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...