2924 search results - page 55 / 585 » Lower Bounds in Distributed Computing |
ICML
2002
IEEE
14 years 9 months ago
2002
IEEE
We study generalization properties of linear learning algorithms and develop a data dependent approach that is used to derive generalization bounds that depend on the margin distr...
CRYPTO
2010
Springer
13 years 10 months ago
2010
Springer
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
CIARP
2004
Springer
14 years 18 days ago
2004
Springer
In this paper, we derive lower and upper bounds for the probability of error for a linear classifier, where the random vectors representing the underlying classes obey the multivar...
TC
2002
13 years 8 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
PODC
2011
ACM
12 years 11 months ago
2011
ACM
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...