1591 search results - page 156 / 319 » Random lifts of graphs |
197
click to vote
FOCS
2008
IEEE
16 years 28 days ago
2008
IEEE
We prove that approximating the Max Acyclic Subgraph problem within a factor better than 1/2 is Unique-Games hard. Specifically, for every constant ε > 0 the following holds:...
162
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...
221
click to vote
INFOCOM
2008
IEEE
16 years 27 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 ...
168
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...