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=284
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for the rate of convergence in nonparametric pattern recognition
András Antos
Theoretical Computer Science
284
(1), 2002, pp. 3-24
Query by committee, linear separation and random walks
Shai Fine
,
Ran Gilad-Bachrach
,
Eli Shamir
Theoretical Computer Science
284
(1), 2002, pp. 25-51
Hardness results for neural network approximation problems
Peter L. Bartlett
,
Shai Ben-David
Theoretical Computer Science
284
(1), 2002, pp. 53-66
A geometric approach to leveraging weak learners
Nigel Duffy
,
David Helmbold
Theoretical Computer Science
284
(1), 2002, pp. 67-108
Direct and indirect algorithms for on-line learning of disjunctions
D.P. Helmbold
,
S. Panizza
,
M.K. Warmuth
Theoretical Computer Science
284
(1), 2002, pp. 109-142
Mind change complexity of learning logic programs
Sanjay Jain
,
Arun Sharma
Theoretical Computer Science
284
(1), 2002, pp. 143-160
Avoiding coding tricks by hyperrobust learning
Matthias Ott
,
Frank Stephan
Theoretical Computer Science
284
(1), 2002, pp. 161-180
On the rate of convergence of error estimates for the partitioning classification rule
Márta Pintér
Theoretical Computer Science
284
(1), 2002, pp. 181-196
Uniform computational complexity of the derivatives of
C^\infty
-functions
Markus Bläser
Theoretical Computer Science
284
(2), 2002, pp. 199-206
Domain representations of partial functions, with applications to spatial objects and constructive volume geometry
J. Blanck
,
V. Stoltenberg-Hansen
,
J.V. Tucker
Theoretical Computer Science
284
(2), 2002, pp. 207-240
Topological properties of real numer representations
Vasco Brattka
,
Peter Hertling
Theoretical Computer Science
284
(2), 2002, pp. 241-257
Kernels of seminorms in constructive analysis
Douglas S. Bridges
,
Nicholas Dudley Ward
Theoretical Computer Science
284
(2), 2002, pp. 259-267
Chaitin
\Omega
numbers, Solovay machines, and Gödel incompleteness
Cristian S. Calude
Theoretical Computer Science
284
(2), 2002, pp. 269-277
Effectively closed sets and graphs of computable real functions
Douglas Cenzer
,
Jeffrey B. Remmel
Theoretical Computer Science
284
(2), 2002, pp. 279-318
Foundation of a computable solid modelling
Abbas Edalat
,
André Lieutier
Theoretical Computer Science
284
(2), 2002, pp. 319-345
Effective metric spaces and representations of the reals
Armin Hemmerling
Theoretical Computer Science
284
(2), 2002, pp. 347-372
Real functions computable by finite automata using affine representations
Michal Konec̑ný
Theoretical Computer Science
284
(2), 2002, pp. 373-396
Effective simultaneous approximability of reals
Vladimir N. Krupski
Theoretical Computer Science
284
(2), 2002, pp. 397-417
On the computability of Walsh functions
Takakazu Mori
Theoretical Computer Science
284
(2), 2002, pp. 419-436
Exact real number computations relative to hereditarily total functionals
Dag Normann
Theoretical Computer Science
284
(2), 2002, pp. 437-453
The Kolmogorov complexity of real numbers
Ludwig Staiger
Theoretical Computer Science
284
(2), 2002, pp. 455-466
Real number computation through Gray code embedding
Hideki Tsuiki
Theoretical Computer Science
284
(2), 2002, pp. 467-485
Interpolation functor and computability
Atsushi Yoshikawa
Theoretical Computer Science
284
(2), 2002, pp. 487-498
The closure properties on real numbers under limits and computable operators
Xizhong Zheng
Theoretical Computer Science
284
(2), 2002, pp. 499-518
Extended admissibility
Matthias Schröder
Theoretical Computer Science
284
(2), 2002, pp. 519-538
Seiten 1
2
>