23 search results - page 1 / 5 » A Parallel Algorithm for Sampling Matchings from an Almost U... |
ISAAC
1998
Springer
13 years 9 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...
ICDCS
2007
IEEE
13 years 11 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...
ISPDC
2010
IEEE
13 years 3 months ago
2010
IEEE
—Providing independent uniform samples from a system population poses considerable problems in highly dynamic settings, like P2P systems, where the number of participants and the...
APPROX
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
EUROPAR
2009
Springer
13 years 11 months ago
2009
Springer
Selecting a random peer with uniform probability across a peer-to-peer (P2P) network is a fundamental function for unstructured search, data replication, and monitoring algorithms....