530 search results - page 88 / 106 » Universal randomized switching |
117
click to vote
SIROCCO
2008
15 years 3 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
122
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
87
Voted
PICS
2001
15 years 3 months ago
2001
A first television system based on the Autosophy information theory is now being tested. The new television marks a major theoretical break from conventional television based on t...
114
Voted
CCS
2010
ACM
15 years 2 months ago
2010
ACM
Protocols for password-based authenticated key exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The...
118
click to vote
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We discuss the definability of finite graphs in first-order logic with two relation symbols for adjacency and equality of vertices. The logical depth D(G) of a graph G is equal to ...