Sciweavers

1734 search results - page 286 / 347
» What works
Sort
View
CCS
2009
ACM
14 years 11 months ago
Automating analysis of large-scale botnet probing events
Botnets dominate today's attack landscape. In this work we investigate ways to analyze collections of malicious probing traffic in order to understand the significance of lar...
Zhichun Li, Anup Goyal, Yan Chen, Vern Paxson
PODC
2009
ACM
14 years 10 months ago
Load balancing without regret in the bulletin board model
We analyze the performance of protocols for load balancing in distributed systems based on no-regret algorithms from online learning theory. These protocols treat load balancing a...
Éva Tardos, Georgios Piliouras, Robert D. K...
KDD
2009
ACM
164views Data Mining» more  KDD 2009»
14 years 10 months ago
Social influence analysis in large-scale networks
In large social networks, nodes (users, entities) are influenced by others for various reasons. For example, the colleagues have strong influence on one's work, while the fri...
Jie Tang, Jimeng Sun, Chi Wang, Zi Yang
KDD
2009
ACM
223views Data Mining» more  KDD 2009»
14 years 10 months ago
Collaborative filtering with temporal dynamics
Customer preferences for products are drifting over time. Product perception and popularity are constantly changing as new selection emerges. Similarly, customer inclinations are ...
Yehuda Koren
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 10 months ago
Efficient influence maximization in social networks
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 ...
Wei Chen, Yajun Wang, Siyu Yang