256 search results - page 2 / 52 » A New Synchronous Lower Bound for Set Agreement |
SIAMCOMP
2008
13 years 3 months ago
2008
Abstract. To cope with the impossibility of solving agreement problems in asynchronous systems made up of n processes and prone to t process crashes, system designers tailor their ...
PDCAT
2005
Springer
13 years 11 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
ACL
1992
13 years 6 months ago
1992
We have recently reported on two new word-sense disambiguation systems, one trained on bilingual material (the Canadian Hansards) and the other trained on monolingual material (Ro...
EUROCRYPT
2003
Springer
13 years 10 months ago
2003
Springer
Perfectly secret message transmission can be realized with only partially secret and weakly correlated information shared by the parties as soon as this information allows for the ...
CORR
2007
Springer
13 years 5 months ago
2007
Springer
We provide new and tight lower bounds on the ability of players to implement equilibria using cheap talk, that is, just allowing communication among the players. One of our main r...