2079 search results - page 384 / 416 » Universality of random graphs |
186
click to vote
PVLDB
2010
14 years 6 months ago
2010
In this paper, we analyze the efficiency of Monte Carlo methods for incremental computation of PageRank, personalized PageRank, and similar random walk based methods (with focus o...
131
click to vote
INFOCOM
2012
IEEE
13 years 2 months ago
2012
IEEE
—Distributed systems without trusted identities are particularly vulnerable to sybil attacks, where an adversary creates multiple bogus identities to compromise the running of th...
136
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
165
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
TCC
2009
Springer
16 years 11 days ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...