2079 search results - page 104 / 416 » Universality of random graphs |
127
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
144
click to vote
IM
2007
15 years 4 months ago
2007
Vertex pursuit games, such as the game of Cops and Robbers, are a simplified model for network security. In these games, cops try to capture a robber loose on the vertices of the ...
137
click to vote
WAIM
2010
Springer
15 years 2 months ago
2010
Springer
We present HyperGraphDB, a novel graph database based on generalized hypergraphs where hyperedges can contain other hyperedges. This generalization automatically reifies every ent...
173
click to vote
WINE
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We present a new technique for analyzing the rate of convergence of local dynamics in bargaining networks. The technique reduces balancing in a bargaining network to opti...
120
click to vote
INFORMATIKTAGE
2008
15 years 5 months ago
2008
: This thesis focuses on the practical aspects of general two-party Secure Function Evaluation (SFE). A new SFE protocol that allows free evaluation of XOR gates and is provably se...