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=473
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tighter PAC-Bayes bounds through distribution-dependent priors
Guy Lever
,
François Laviolette
,
John Shawe-Taylor
Theoretical Computer Science
473
, 2013, pp. 4-28
PAC learnability under non-atomic measures: A problem by Vidyasagar
Vladimir Pestov
Theoretical Computer Science
473
, 2013, pp. 29-45
Learning probabilistic automata: A study in state distinguishability
Borja Balle
,
Jorge Castro
,
Ricard Gavaldà
Theoretical Computer Science
473
, 2013, pp. 46-60
Switching investments
Wouter M. Koolen
,
Steven de Rooij
Theoretical Computer Science
473
, 2013, pp. 61-76
Toward a classification of finite partial-monitoring games
András Antos
,
Gábor Bartók
,
Dávid Pál
,
Csaba Szepesvári
Theoretical Computer Science
473
, 2013, pp. 77-99
Memory-limited non-U-shaped learning with solved open problems
John Case
,
Timo Kötzing
Theoretical Computer Science
473
, 2013, pp. 100-123
Learning without coding
Sanjay Jain
,
Samuel E. Moelius III
,
Sandra Zilles
Theoretical Computer Science
473
, 2013, pp. 124-148
Asymptotic non-learnability of universal agents with computable horizon functions
Laurent Orseau
Theoretical Computer Science
473
, 2013, pp. 149-156
An identity for kernel ridge regression
Fedor Zhdanov
,
Yuri Kalnishkan
Theoretical Computer Science
473
, 2013, pp. 157-178