856 search results - page 119 / 172 » On Randomness Measures for Social Networks. |
139
click to vote
ICDCS
2010
IEEE
15 years 10 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
163
click to vote
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
Maximal clique enumeration (MCE) is a fundamental problem in graph theory and has important applications in many areas such as social network analysis and bioinformatics. The prob...
210
click to vote
CN
2011
15 years 1 months ago
2011
In many scenarios network design is not enforced by a central authority, but arises from the interactions of several self-interested agents. This is the case of the Internet, wher...
180
click to vote
WSDM
2012
ACM
14 years 1 months ago
2012
ACM
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
150
click to vote
AINA
2008
IEEE
16 years 18 days ago
2008
IEEE
This paper shows that the performance of peer-to-peer resource discovery algorithms is upper bounded by a k-Steiner minimum tree and proposes an algorithm locating near-optimal qu...