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=364
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Criterion of calibration for transductive confidence machine with limited feedback
Ilia Nouretdinov
,
Vladimir Vovk
Theoretical Computer Science
364
(1), 2006, pp. 3-9
Well-calibrated predictions from on-line compression models
Vladimir Vovk
Theoretical Computer Science
364
(1), 2006, pp. 10-26
On generalized computable universal priors and their convergence
Marcus Hutter
Theoretical Computer Science
364
(1), 2006, pp. 27-41
An approach to intrinsic complexity of uniform learning
Sandra Zilles
Theoretical Computer Science
364
(1), 2006, pp. 42-61
On ordinal VC-dimension and some notions of complexity
Eric Martin
,
Arun Sharma
,
Frank Stephan
Theoretical Computer Science
364
(1), 2006, pp. 62-76
From learning in the limit to stochastic finite learning
Thomas Zeugmann
Theoretical Computer Science
364
(1), 2006, pp. 77-97
Learning of erasing primitive formal systems from positive examples
Jin Uemura
,
Masako Sato
Theoretical Computer Science
364
(1), 2006, pp. 98-114
Learning a subclass of regular patterns in polynomial time
John Case
,
Sanjay Jain
,
Rüdiger Reischuk
,
Frank Stephan
,
Thomas Zeugmann
Theoretical Computer Science
364
(1), 2006, pp. 115-131
Signal extraction and knowledge discovery based on statistical modeling
Genshiro Kitagawa
Theoretical Computer Science
364
(1), 2006, pp. 132-142
Categorical proof theory of classical propositional calculus
Gianluigi Bellin
,
Martin Hyland
,
Edmund Robinson
,
Christian Urban
Theoretical Computer Science
364
(2), 2006, pp. 146-165
Differential interaction nets
T. Ehrhard
,
L. Regnier
Theoretical Computer Science
364
(2), 2006, pp. 166-195
On decidability properties of local sentences
Olivier Finkel
Theoretical Computer Science
364
(2), 2006, pp. 196-211
Deciding implication for functional dependencies in complex-value databases
Sven Hartmann
,
Sebastian Link
Theoretical Computer Science
364
(2), 2006, pp. 212-240
Default theories over monadic languages
Michael Kaminski
,
Julia Rubin-Mosin
Theoretical Computer Science
364
(2), 2006, pp. 241-253
Generic models for computational effects
John Power
Theoretical Computer Science
364
(2), 2006, pp. 254-269
Proof-carrying code from certified abstract interpretation and fixpoint compression
Frédéeric Besson
,
Thomas Jensen
,
David Pichardie
Theoretical Computer Science
364
(3), 2006, pp. 273-291
Type systems equivalent to data-flow analyses for imperative languages
Peeter Laud
,
Tarmo Uustalu
,
Varmo Vene
Theoretical Computer Science
364
(3), 2006, pp. 292-310
Securing the .NET programming model
Andrew Kennedy
Theoretical Computer Science
364
(3), 2006, pp. 311-317
Formal and incremental construction of distributed algorithms: On the distributed reference counting algorithm
Dominique Cansell
,
Dominique Méry
Theoretical Computer Science
364
(3), 2006, pp. 318-337
A concurrent lambda calculus with futures
J. Niehren
,
J. Schwinghammer
,
G. Smolka
Theoretical Computer Science
364
(3), 2006, pp. 338-356