978 search results - page 103 / 196 » Knowledge, Probability, and Adversaries |
STOC
1991
ACM
15 years 1 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
DC
2008
14 years 10 months ago
2008
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
100
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
102
click to vote
ECCC
2011
14 years 4 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
165
click to vote
PVLDB
2010
14 years 4 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...