2079 search results - page 193 / 416 » Universality of random graphs |
163
click to vote
ASIACRYPT
2008
Springer
15 years 8 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...
223
click to vote
INFOCOM
2008
IEEE
16 years 29 days 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 ...
160
click to vote
STOC
1991
ACM
15 years 10 months ago
1991
ACM
The study of self-testing/correcting programs was introduced in [8] in order to allow one to use program P to compute function f without trusting that P works correctly. A self-te...
170
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
181
click to vote
EMNLP
2010
15 years 4 months ago
2010
Existing graph-based ranking methods for keyphrase extraction compute a single importance score for each word via a single random walk. Motivated by the fact that both documents a...