339 search results - page 4 / 68 » Random Sampling Techniques in Parallel Computation |
ISAAC
1998
Springer
15 years 1 months ago
1998
Springer
In this paper we present a randomized parallel algorithm to sample matchings from an almost uniform distribution on the set of matchings of all sizes in a graph. First we prove th...
IPPS
2005
IEEE
15 years 3 months ago
2005
IEEE
We propose in this paper a heuristic for mapping a set of interacting tasks of a parallel application onto a heterogeneous computing platform such as a computational grid. Our nov...
116
click to vote
DFG
1992
Springer
15 years 1 months ago
1992
Springer
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
ECCV
2000
Springer
15 years 11 months ago
2000
Springer
The problem of tracking pedestrians from a moving car is a challenging one. The Condensation tracking algorithm is appealing for its generality and potential for real-time implemen...
ICDCS
2007
IEEE
15 years 3 months ago
2007
IEEE
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...