339 search results - page 3 / 68 » Random Sampling Techniques in Parallel Computation |
NETWORKS
2008
14 years 9 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
For many probability distributions of interest, it is quite difficult to obtain samples efficiently. Often, Markov chains are employed to obtain approximately random samples fro...
EUROPAR
2009
Springer
15 years 4 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....
ICS
1998
Tsinghua U.
15 years 1 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 ...
STACS
2009
Springer
15 years 4 months ago
2009
Springer
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...