5153 search results - page 153 / 1031 » Introduction to Randomized Algorithms |
101
Voted
IPPS
1998
IEEE
15 years 7 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...
120
Voted
ICS
1998
Tsinghua U.
15 years 7 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 ...
111
Voted
ICDM
2003
IEEE
15 years 8 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 ...
116
click to vote
ESA
2001
Springer
15 years 7 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...
118
Voted
WEA
2004
Springer
15 years 8 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...