1806 search results - page 311 / 362 » Randomness and halting probabilities |
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...
PKC
2005
Springer
15 years 5 months ago
2005
Springer
A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-...
INFOCOM
2002
IEEE
15 years 4 months ago
2002
IEEE
— Most of the currently deployed multicast protocols (e.g. DVMRP, PIM, MOSPF) build one shortest path multicast tree per sender, the tree being rooted at the sender’s subnetwor...
107
click to vote
MPC
2010
Springer
15 years 4 months ago
2010
Springer
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
104
click to vote
IBPRIA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we argue that maximum expected utility is a suitable framework for modeling a broad range of decision problems arising in pattern recognition and related fields. Exa...