5891 search results - page 993 / 1179 » On the Computational Security of a Distributed Key Distribut... |
135
click to vote
SIGMETRICS
2002
ACM
15 years 6 months ago
2002
ACM
It is well known that optimal server placement is NP-hard. We present an approximate model for the case when both clients and servers are dense, and propose a simple server alloca...
172
click to vote
AIMS
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. A central issue in autonomic management is how to coordinate several autonomic management processes, which is assumed to require significant knowledge exchange. This stu...
150
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In a paper presented last year at WMPP’01 [Walker01], we described the initial prototype of an associative processor implemented using field-programmable logic devices (FPLDs). ...
210
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
188
click to vote
SOSP
2005
ACM
16 years 3 months ago
2005
ACM
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...