735 search results - page 21 / 147 » Randomization in Parallel Stringology |
149
Voted
TPDS
2010
15 years 7 days ago
2010
—One widely used mechanism for representing membership of a set of items is the simple space-efficient randomized data structure known as Bloom filters. Yet, Bloom filters are no...
100
click to vote
MST
2000
15 years 1 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
108
click to vote
IPPS
1998
IEEE
15 years 6 months ago
1998
IEEE
Abstract. We give a high-level description of some fundamental randomized and deterministic techniques for routing and sorting on xedconnection networks such as meshes, hypercubes ...
103
Voted
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...
101
Voted
SPAA
1992
ACM
15 years 6 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...