4007 search results - page 97 / 802 » Computation with imprecise probabilities |
78
Voted
SAGA
2007
Springer
15 years 6 months ago
2007
Springer
We present two results for computational models that allow error probabilities close to 1/2. First, most computational complexity classes have an analogous class in communication ...
92
Voted
SPAA
1992
ACM
15 years 4 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
DSS
2008
15 years 20 days ago
2008
This article reviews weblogs and their role as a social networking device for young people and its probable evolution to the organizational computing medium. The motivation of you...
124
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
TCC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Parallel repetition is well known to reduce the error probability at an exponential rate for single- and multi-prover interactive proofs. Bellare, Impagliazzo and Naor (1...