Sciweavers

3017 search results - page 603 / 604
» On compressing social networks
Sort
View
KDD
2012
ACM
196views Data Mining» more  KDD 2012»
11 years 8 months ago
Chromatic correlation clustering
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
Francesco Bonchi, Aristides Gionis, Francesco Gull...
SIGIR
2012
ACM
11 years 8 months ago
Cognos: crowdsourcing search for topic experts in microblogs
Finding topic experts on microblogging sites with millions of users, such as Twitter, is a hard and challenging problem. In this paper, we propose and investigate a new methodolog...
Saptarshi Ghosh, Naveen Kumar Sharma, Fabrí...
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
11 years 8 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
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 8 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
11 years 8 months ago
Pricing cloud bandwidth reservations under demand uncertainty
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
Di Niu, Chen Feng, Baochun Li