Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=558
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Confident and consistent partial learning of recursive functions
Ziyuan Gao
,
Frank Stephan
Theoretical Computer Science
558
, 2014, pp. 5-17
Regular inference as vertex coloring
Christophe Costa Florêncio
,
Sicco Verwer
Theoretical Computer Science
558
, 2014, pp. 18-34
Algebraic methods proving Sauer's bound for teaching complexity
Rahim Samei
,
Pavel Semukhin
,
Boting Yang
,
Sandra Zilles
Theoretical Computer Science
558
, 2014, pp. 35-50
Data stability in clustering: A closer look
Shalev Ben-David
,
Lev Reyzin
Theoretical Computer Science
558
, 2014, pp. 51-61
Regret bounds for restless Markov bandits
Ronald Ortner
,
Daniil Ryabko
,
Peter Auer
,
Rémi Munos
Theoretical Computer Science
558
, 2014, pp. 62-76
Minimax number of strata for online stratified sampling: The case of noisy samples
Alexandra Carpentier
,
Rémi Munos
Theoretical Computer Science
558
, 2014, pp. 77-106
Weighted last-step min-max algorithm with improved sub-logarithmic regret
Edward Moroshko
,
Koby Crammer
Theoretical Computer Science
558
, 2014, pp. 107-124
Near-optimal PAC bounds for discounted MDPs
Tor Lattimore
,
Marcus Hutter
Theoretical Computer Science
558
, 2014, pp. 125-143
Buy low, sell high
Wouter M. Koolen
,
Vladimir Vovk
Theoretical Computer Science
558
, 2014, pp. 144-158
Kernelization of matrix updates, when and how?
Manfred K. Warmuth
,
Wojciech Kotƚowski
,
Shuisheng Zhou
Theoretical Computer Science
558
, 2014, pp. 159-178