2924 search results - page 55 / 585 » Lower Bounds in Distributed Computing |
126
click to vote
ICML
2002
IEEE
16 years 3 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...
143
click to vote
CRYPTO
2010
Springer
15 years 3 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...
126
click to vote
CIARP
2004
Springer
15 years 6 months 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...
144
click to vote
TC
2002
15 years 2 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...
182
click to vote
PODC
2011
ACM
14 years 5 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...