Sciweavers

835 search results - page 21 / 167
» Adaptive Bound Optimization for Online Convex Optimization
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 3 months ago
Optimal online assignment with forecasts
Motivated by the allocation problem facing publishers in display advertising we formulate the online assignment with forecast problem, a version of the online allocation problem w...
Erik Vee, Sergei Vassilvitskii, Jayavel Shanmugasu...
WIOPT
2010
IEEE
13 years 8 months ago
Optimizing power allocation in interference channels using D.C. programming
Abstract--Power allocation is a promising approach for optimizing the performance of mobile radio systems in interference channels. In the present paper, the non-convex objective f...
Hussein Al-Shatri, Tobias Weber
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 5 months ago
Treemaps with Bounded Aspect Ratio
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...
Mark de Berg, Bettina Speckmann, Vincent van der W...
ICCV
2005
IEEE
15 years 9 days ago
Globally Optimal Estimates for Geometric Reconstruction Problems
We introduce a framework for computing statistically optimal estimates of geometric reconstruction problems. While traditional algorithms often suffer from either local minima or ...
Fredrik Kahl, Didier Henrion
SODA
2008
ACM
97views Algorithms» more  SODA 2008»
13 years 11 months ago
Stochastic analyses for online combinatorial optimization problems
In this paper, we study online algorithms when the input is not chosen adversarially, but consists of draws from some given probability distribution. While this model has been stu...
Naveen Garg, Anupam Gupta, Stefano Leonardi, Piotr...