Sciweavers

450 search results - page 27 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
SIGECOM
2010
ACM
170views ECommerce» more  SIGECOM 2010»
14 years 21 days 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...
WINE
2010
Springer
164views Economy» more  WINE 2010»
13 years 5 months ago
Incentives in Online Auctions via Linear Programming
Online auctions in which items are sold in an online fashion with little knowledge about future bids are common in the internet environment. We study here a problem in which an auc...
Niv Buchbinder, Kamal Jain, Mohit Singh
CVPR
2007
IEEE
13 years 11 months ago
Improving Part based Object Detection by Unsupervised, Online Boosting
Detection of objects of a given class is important for many applications. However it is difficult to learn a general detector with high detection rate as well as low false alarm r...
Bo Wu, Ram Nevatia
ATAL
2008
Springer
13 years 10 months ago
Emerging coordination in infinite team Markov games
In this paper we address the problem of coordination in multi-agent sequential decision problems with infinite statespaces. We adopt a game theoretic formalism to describe the int...
Francisco S. Melo, M. Isabel Ribeiro
TAMC
2007
Springer
14 years 2 months ago
Kernelizations for Parameterized Counting Problems
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
Marc Thurley