Sciweavers

10901 search results - page 20 / 2181
» Approximations in Distributed Optimization
Sort
View
SODA
2012
ACM
200views Algorithms» more  SODA 2012»
13 years 4 months ago
Optimal crowdsourcing contests
We study the design and approximation of optimal crowdsourcing contests. Crowdsourcing contests can be modeled as all-pay auctions because entrants must exert effort up-front to e...
Shuchi Chawla, Jason D. Hartline, Balasubramanian ...
DMSN
2004
ACM
15 years 8 months ago
Approximately uniform random sampling in sensor networks
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
Boulat A. Bash, John W. Byers, Jeffrey Considine
ICAC
2006
IEEE
15 years 8 months ago
Hardness of Approximation and Greedy Algorithms for the Adaptation Problem in Virtual Environments
— Over the past decade, wide-area distributed computing has emerged as a powerful computing paradigm. Virtual machines greatly simplify wide-area distributed computing ing the ab...
Ananth I. Sundararaj, Manan Sanghi, John R. Lange,...
ICMCS
2005
IEEE
131views Multimedia» more  ICMCS 2005»
15 years 8 months ago
A Distributed Algorithm for Congestion-Minimized Multi-Path Routing Over Ad-Hoc Networks
When an ad hoc network with limited link capacities is used to transport high-rate, latency-constrained multimedia streams, it is important that routing algorithms not only yield ...
Xiaoqing Zhu, Bernd Girod
ICDT
2011
ACM
232views Database» more  ICDT 2011»
14 years 6 months ago
(Approximate) uncertain skylines
Given a set of points with uncertain locations, we consider the problem of computing the probability of each point lying on the skyline, that is, the probability that it is not do...
Peyman Afshani, Pankaj K. Agarwal, Lars Arge, Kasp...