Sciweavers

COLT
2008
Springer
14 years 1 months ago
High-Probability Regret Bounds for Bandit Online Linear Optimization
We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ( ...
Peter L. Bartlett, Varsha Dani, Thomas P. Hayes, S...
STOC
2007
ACM
146views Algorithms» more  STOC 2007»
14 years 11 months ago
Playing games with approximation algorithms
In an online linear optimization problem, on each period t, an online algorithm chooses st S from a fixed (possibly infinite) set S of feasible decisions. Nature (who may be adve...
Sham M. Kakade, Adam Tauman Kalai, Katrina Ligett
ICIP
2006
IEEE
15 years 1 months ago
Signal Processing Problems and Algorithms in Display Side of 3DTV
Two important signal processing problems in the display side of a holographic 3DTV are the computation of the diffraction field of a 3D object from its abstract representation, an...
Atanas P. Gotchev, Erdem Ulusoy, Gokhan Bora Esmer...