2924 search results - page 186 / 585 » Lower Bounds in Distributed Computing |
140
click to vote
FOCS
2008
IEEE
15 years 9 months ago
2008
IEEE
We study the learnability of sets in Rn under the Gaussian distribution, taking Gaussian surface area as the “complexity measure” of the sets being learned. Let CS denote the ...
120
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Statistical learning theory chiefly studies restricted hypothesis classes, particularly those with finite Vapnik-Chervonenkis (VC) dimension. The fundamental quantity of interest i...
137
click to vote
DBISP2P
2003
Springer
15 years 8 months ago
2003
Springer
In this paper we give a robust logical and computational characterisation of peer-to-peer (p2p) database systems. We first define a precise model-theoretic semantics of a p2p sys...
119
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Most protocols for distributed, fault-tolerant computation, or multi-party computation (MPC), provide security guarantees in an all-or-nothing fashion: If the number of corrupted p...
148
click to vote
PODC
2009
ACM
16 years 11 days ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...