1255 search results - page 208 / 251 » On Simple and Secure Key Distribution |
105
click to vote
PODC
2010
ACM
15 years 8 months ago
2010
ACM
We present a proof of safety and linearizability of a highlyconcurrent optimistic set algorithm. The key step in our proof is the Hindsight Lemma, which allows a thread to infer t...
143
click to vote
ICAS
2009
IEEE
15 years 8 months ago
2009
IEEE
The increased complexity of today's distributed, composite, Web-based systems presents difficult and unique systems management problems. The way these systems interact, and th...
145
click to vote
HIPC
2000
Springer
15 years 8 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
128
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we will consider tight upper- and lower-bounds on the weight of the optimal matching for random point sets distributed among the leaves of a tree, as a function of it...
141
click to vote
NCA
2002
IEEE
15 years 4 months ago
2002
IEEE
One of the key problems in forming a smooth model from input-output data is the determination of which input variables are relevant in predicting a given output. In this paper we ...