848 search results - page 69 / 170 » Randomness and the linear degrees of computability |
104
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider the problems of Byzantine Agreement and Leader Election, where a constant fraction b < 1/3 of processors are controlled by a malicious adversary. The first problem...
112
click to vote
ICA
2004
Springer
15 years 5 months ago
2004
Springer
In this paper, we consider independence property between a random process and its first derivative. Then, for linear mixtures, we show that cross-correlations between mixtures and...
107
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
We show an efficient secure two-party protocol, based on Yao's construction, which provides security against malicious adversaries. Yao's original protocol is only secur...
180
click to vote
SIGMOD
2007
ACM
16 years 1 hour ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
NIPS
2004
15 years 1 months ago
2004
We introduce a computationally efficient method to estimate the validity of the BP method as a function of graph topology, the connectivity strength, frustration and network size....