Sciweavers

1806 search results - page 80 / 362
» Randomness and halting probabilities
Sort
View
SIGMETRICS
2004
ACM
107views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
On zone-balancing of peer-to-peer networks: analysis of random node join
Balancing peer-to-peer graphs, including zone-size distributions, has recently become an important topic of peer-topeer (P2P) research [1], [2], [6], [19], [31], [36]. To bring an...
Xiaoming Wang, Yueping Zhang, Xiafeng Li, Dmitri L...
FSTTCS
1990
Springer
14 years 28 days ago
Randomized Parallel Selection
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
Sanguthevar Rajasekaran
CSDA
2010
118views more  CSDA 2010»
13 years 9 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
CORR
2006
Springer
118views Education» more  CORR 2006»
13 years 9 months ago
Minimally Invasive Randomization for Collecting Unbiased Preferences from Clickthrough Logs
Clickthrough data is a particularly inexpensive and plentiful resource to obtain implicit relevance feedback for improving and personalizing search engines. However, it is well kn...
Filip Radlinski, Thorsten Joachims
ETT
2000
106views Education» more  ETT 2000»
13 years 8 months ago
On Union Bounds for Random Serially Concatenated Turbo Codes with Maximum Likelihood Decoding
The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice ov...
Igal Sason, Shlomo Shamai