Sciweavers

53302 search results - page 10535 / 10661
» On the design of a
Sort
View
OPODIS
2010
13 years 7 months ago
Signature-Free Broadcast-Based Intrusion Tolerance: Never Decide a Byzantine Value
: Provide application processes with strong agreement guarantees despite failures is a fundamental problem of fault-tolerant distributed computing. Correct processes have not to be...
Achour Mostéfaoui, Michel Raynal
OPODIS
2010
13 years 7 months ago
Application of Random Walks to Decentralized Recommender Systems
The need for efficient decentralized recommender systems has been appreciated for some time, both for the intrinsic advantages of decentralization and the necessity of integrating...
Anne-Marie Kermarrec, Vincent Leroy, Afshin Moin, ...
OPODIS
2010
13 years 7 months ago
Biased Selection for Building Small-World Networks
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...
Andrés Sevilla, Alberto Mozo, M. Araceli Lo...
P2P
2010
IEEE
136views Communications» more  P2P 2010»
13 years 7 months ago
On the Privacy of Peer-Assisted Distribution of Security Patches
Abstract--When a host discovers that it has a software vulnerability that is susceptible to an attack, the host needs to obtain and install a patch. Because centralized distributio...
Di Wu, Cong Tang, Prithula Dhungel, Nitesh Saxena,...
PAISI
2010
Springer
13 years 7 months ago
Efficient Privacy Preserving K-Means Clustering
Abstract. This paper introduces an efficient privacy-preserving protocol for distributed K-means clustering over an arbitrary partitioned data, shared among N parties. Clustering i...
Maneesh Upmanyu, Anoop M. Namboodiri, Kannan Srina...
« Prev « First page 10535 / 10661 Last » Next »