Sciweavers

Share
8 search results - page 1 / 2
» alt 2011
Sort
View
ELECTRONICMARKETS
2011
80views more  ELECTRONICMARKETS 2011»
8 years 5 months ago
Editorial 21/1
Hubert Österle, Hans-Dieter Zimmermann, Raine...
ALT
2011
Springer
7 years 10 months ago
Deviations of Stochastic Bandit Regret
This paper studies the deviations of the regret in a stochastic multi-armed bandit problem. When the total number of plays n is known beforehand by the agent, Audibert et al. (2009...
Antoine Salomon, Jean-Yves Audibert
ALT
2011
Springer
7 years 10 months ago
On Noise-Tolerant Learning of Sparse Parities and Related Problems
We consider the problem of learning sparse parities in the presence of noise. For learning parities on r out of n variables, we give an algorithm that runs in time poly log 1 δ , ...
Elena Grigorescu, Lev Reyzin, Santosh Vempala
ESA
2011
Springer
249views Algorithms» more  ESA 2011»
7 years 10 months ago
Improved Algorithms for Partial Curve Matching
Back in 1995, Alt and Godau gave an efficient algorithm for deciding whether a given curve resembles some part of a larger curve under a fixed Fr´echet distance, achieving a runn...
Anil Maheshwari, Jörg-Rüdiger Sack, Kave...
ALT
2011
Springer
7 years 10 months ago
Semantic Communication for Simple Goals Is Equivalent to On-line Learning
Abstract. Previous works [11, 6] introduced a model of semantic communication between a “user” and a “server,” in which the user attempts to achieve a given goal for commun...
Brendan Juba, Santosh Vempala
books