2924 search results - page 145 / 585 » Lower Bounds in Distributed Computing |
109
click to vote
COLT
2010
Springer
14 years 10 months ago
2010
Springer
In recent years analysis of complexity of learning Gaussian mixture models from sampled data has received significant attention in computational machine learning and theory commun...
PODC
2004
ACM
15 years 6 months ago
2004
ACM
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
98
Voted
CLUSTER
2001
IEEE
15 years 4 months ago
2001
IEEE
Using multiple independent networks (also known as rails) is an emerging technique to overcome bandwidth limitations and enhance fault tolerance of current high-performance parall...
142
Voted
PODC
1998
ACM
15 years 4 months ago
1998
ACM
A contract is a non-repudiable agreement on a given contract text, i.e., a contract can be used to prove agreement between its signatories to any verifier. A contract signing sche...
122
Voted
ICDCN
2011
Springer
14 years 4 months ago
2011
Springer
Abstract. Wireless sensor networks (WSNs) deployed in hostile environments suffer from a high rate of node failure. We investigate the effect of such failure rate on network conn...