Sciweavers

46931 search results - page 9375 / 9387
» Networking the networks
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 13 days 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»
13 years 13 days 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
CVPR
2012
IEEE
13 years 13 days ago
The use of on-line co-training to reduce the training set size in pattern recognition methods: Application to left ventricle seg
The use of statistical pattern recognition models to segment the left ventricle of the heart in ultrasound images has gained substantial attention over the last few years. The mai...
Gustavo Carneiro, Jacinto C. Nascimento
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 13 days 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
PODC
2012
ACM
13 years 13 days ago
The cost of fault tolerance in multi-party communication complexity
Multi-party communication complexity involves distributed computation of a function over inputs held by multiple distributed players. A key focus of distributed computing research...
Binbin Chen, Haifeng Yu, Yuda Zhao, Phillip B. Gib...
« Prev « First page 9375 / 9387 Last » Next »