Sciweavers

14331 search results - page 2755 / 2867
» On the modeling and analysis of obligations
Sort
View
PODC
2009
ACM
16 years 7 months ago
Bounding the locality of distributed routing algorithms
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
Prosenjit Bose, Paz Carmi, Stephane Durocher
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
16 years 7 months ago
Mining social networks for personalized email prioritization
Email is one of the most prevalent communication tools today, and solving the email overload problem is pressingly urgent. A good way to alleviate email overload is to automatical...
Shinjae Yoo, Yiming Yang, Frank Lin, Il-Chul Moon
KDD
2009
ACM
230views Data Mining» more  KDD 2009»
16 years 7 months ago
Analyzing patterns of user content generation in online social networks
Various online social networks (OSNs) have been developed rapidly on the Internet. Researchers have analyzed different properties of such OSNs, mainly focusing on the formation an...
Lei Guo, Enhua Tan, Songqing Chen, Xiaodong Zhang,...
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 7 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 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
« Prev « First page 2755 / 2867 Last » Next »