Sciweavers

267 search results - page 51 / 54
» On the approximability of influence in social networks
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 11 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
INFOCOM
2010
IEEE
13 years 6 months ago
Surfing the Blogosphere: Optimal Personalized Strategies for Searching the Web
We propose a distributed mechanism for finding websurfing strategies that is inspired by the StumbleUpon recommendation engine. Each day, a websurfer visits a sequence of websites ...
Stratis Ioannidis, Laurent Massoulié
KDD
2005
ACM
162views Data Mining» more  KDD 2005»
14 years 9 months ago
Discovering frequent topological structures from graph datasets
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
Ruoming Jin, Chao Wang, Dmitrii Polshakov, Sriniva...
ICDM
2010
IEEE
208views Data Mining» more  ICDM 2010»
13 years 6 months ago
Bonsai: Growing Interesting Small Trees
Graphs are increasingly used to model a variety of loosely structured data such as biological or social networks and entityrelationships. Given this profusion of large-scale graph ...
Stephan Seufert, Srikanta J. Bedathur, Juliá...
ICDM
2009
IEEE
202views Data Mining» more  ICDM 2009»
13 years 6 months ago
Link Prediction on Evolving Data Using Matrix and Tensor Factorizations
Abstract--The data in many disciplines such as social networks, web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In t...
Evrim Acar, Daniel M. Dunlavy, Tamara G. Kolda