36 search results - page 3 / 8 » Efficient influence maximization in social networks |
AAAI
2010
13 years 6 months ago
2010
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
PODC
2010
ACM
13 years 7 months ago
2010
ACM
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
ASUNAM
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--We present a novel and efficient algorithm, PATH COVERING, for solving the most reliable subgraph problem. A reliable subgraph gives a concise summary of the connectivity...
WEBI
2007
Springer
13 years 11 months ago
2007
Springer
The paper develops a novel computational framework for predicting communication flow in social networks based on several contextual features. The problem is important because pred...
JSAC
2006
13 years 5 months ago
2006
We study the flow control and routing decisions of self-interested users in a general congested network where a single profit-maximizing service provider sets prices for different ...