1542 search results - page 222 / 309 » The metamathematics of random graphs |
154
click to vote
INFOCOM
2012
IEEE
13 years 4 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...
152
click to vote
SODA
2012
ACM
13 years 4 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 ...
185
click to vote
CVPR
2012
IEEE
13 years 4 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...
104
click to vote
WWW
2003
ACM
16 years 2 months ago
2003
ACM
We propose two new tools to address the evolution of hyperlinked corpora. First, we define time graphs to extend the traditional notion of an evolving directed graph, capturing li...
98
Voted
RANDOM
1998
Springer
15 years 5 months ago
1998
Springer
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...