Sciweavers

867 search results - page 140 / 174
» Network Robustness and Graph Topology
Sort
View
EUROCRYPT
2008
Springer
13 years 9 months ago
Almost-Everywhere Secure Computation
Secure multi-party computation (MPC) is a central problem in cryptography. Unfortunately, it is well known that MPC is possible if and only if the underlying communication network...
Juan A. Garay, Rafail Ostrovsky
UAI
1996
13 years 9 months ago
An evaluation of structural parameters for probabilistic reasoning: Results on benchmark circuits
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
Yousri El Fattah, Rina Dechter
HIPC
2007
Springer
14 years 1 months ago
Multi-objective Peer-to-Peer Neighbor-Selection Strategy Using Genetic Algorithm
Peer-to-peer (P2P) topology has significant influence on the performance, search efficiency and functionality, and scalability of the application. In this paper, we present a Gen...
Ajith Abraham, Benxian Yue, Chenjing Xian, Hongbo ...
SODA
2004
ACM
120views Algorithms» more  SODA 2004»
13 years 9 months ago
Optimal routing in Chord
We propose optimal routing algorithms for Chord [1], a popular topology for routing in peer-to-peer networks. Chord is an undirected graph on 2b nodes arranged in a circle, with e...
Prasanna Ganesan, Gurmeet Singh Manku
UAI
1994
13 years 9 months ago
A Probabilistic Calculus of Actions
Wepresenta symbolicmachinerythatadmits bothprobabilisticand causalinformation abouta givendomainand producesprobabilisticstatementsabouttheeffectofactions andtheimpactof observati...
Judea Pearl