2304 search results - page 313 / 461 » On the Vulnerability of Large Graphs |
106
click to vote
DAC
2004
ACM
16 years 1 months ago
2004
ACM
Instances of the Boolean satisfiability problem (SAT) arise in many areas of circuit design and verification. These instances are typically constructed from some human-designed ar...
97
Voted
WWW
2009
ACM
16 years 1 months ago
2009
ACM
We examine the behavioral patterns of email usage in a large-scale enterprise over a three-month period. In particular, we focus on two main questions: (Q1) what do replies depend...
121
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
In this note we consider a simple reformulation of the traditional power iteration algorithm for computing the stationary distribution of a Markov chain. Rather than communicate t...
114
Voted
WWW
2004
ACM
16 years 1 months ago
2004
ACM
A (directed) network of people connected by ratings or trust scores, and a model for propagating those trust scores, is a fundamental building block in many of today's most s...
124
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
We present a novel algorithm for the fast computation of PageRank, a hyperlink-based estimate of the "importance" of Web pages. The original PageRank algorithm uses the ...