1756 search results - page 309 / 352 » Directed scale-free graphs |
110
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
115
click to vote
KDD
2007
ACM
16 years 28 days ago
2007
ACM
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
201
Voted
POPL
2003
ACM
16 years 25 days ago
2003
ACM
Multimedia and network processing applications make extensive use of subword data. Since registers are capable of holding a full data word, when a subword variable is assigned a r...
100
Voted
STOC
2007
ACM
16 years 25 days ago
2007
ACM
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
79
Voted
ICDCS
2009
IEEE
15 years 9 months ago
2009
IEEE
A number of network path delay, loss, or bandwidth inference mechanisms have been proposed over the past decade. Concurrently, several network measurement services have been deplo...