1542 search results - page 164 / 309 » The metamathematics of random graphs |
103
click to vote
ASIACRYPT
2008
Springer
15 years 3 months ago
2008
Springer
Recently, Desmedt et al. studied the problem of achieving secure n-party computation over non-Abelian groups. They considered the passive adversary model and they assumed that the...
153
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
—In an n-way broadcast application each one of n overlay nodes wants to push its own distinct large data file to all other n-1 destinations as well as download their respective ...
113
click to vote
SIGMETRICS
2002
ACM
15 years 1 months ago
2002
ACM
Decentralized and unstructured peer-to-peer networks such as Gnutella are attractive for certain applications because they require no centralized directories and no precise contro...
95
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
Abstract—We introduce a new class of exact MinimumBandwidth Regenerating (MBR) codes for distributed storage systems, characterized by a low-complexity uncoded repair process tha...
MOR
2010
15 years 9 days ago
2010
We consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an age...