7228 search results - page 468 / 1446 » From Algorithmic to Subjective Randomness |
145
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
191
Voted
SIGOPS
2010
15 years 5 months ago
2010
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
201
click to vote
CIKM
2010
Springer
15 years 4 months ago
2010
Springer
Deploying a classifier to large-scale systems such as the web requires careful feature design and performance evaluation. Evaluation is particularly challenging because these larg...
251
click to vote
MOBIHOC
2012
ACM
13 years 9 months ago
2012
ACM
We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dy...
210
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
—Raz’s parallel repetition theorem [21] together with improvements of Holenstein [12] shows that for any two-prover one-round game with value at most 1 − (for ≤ 1/2), the v...