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=Algorithmica AND Volume=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Can finite samples detect singularities of real-valued functions?
S. Ben-David
Algorithmica
22
(1-2), 1998, pp. 3-17
A good oracle is hard to beat
D.A. Cenzer
,
W.R. Moser
Algorithmica
22
(1-2), 1998, pp. 18-34
A polynomial-time algorithm for learning noisy linear threshold functions
A. Blum
,
A. Frieze
,
R. Kannan
,
S. Vempala
Algorithmica
22
(1-2), 1998, pp. 35-52
PAC learning intersections of halfspaces with membership queries
S. Kwek
,
L. Pitt
Algorithmica
22
(1-2), 1998, pp. 53-75
Learning boxes in high dimension
A. Beimel
,
E. Kushilevitz
Algorithmica
22
(1-2), 1998, pp. 76-90
Learning matrix functions over rings
N.H. Bshouty
,
C. Tamon
,
D.K. Wilson
Algorithmica
22
(1-2), 1998, pp. 91-111
On Bayes methods for on-line Boolean prediction
N. Cesa-Bianchi
,
D.P. Helmbold
,
S. Panizza
Algorithmica
22
(1-2), 1998, pp. 112-137
Strategy under the unknown stochastic environment: The nonparametric lob-pass problem
K. Hiraoka
,
S. Amari
Algorithmica
22
(1-2), 1998, pp. 138-156
Classification accuracy based on observed margin
J. Shawe-Taylor
Algorithmica
22
(1-2), 1998, pp. 157-172
Minimizing
\alpha
-information for generalization and interpretation
R. Kamimura
Algorithmica
22
(1-2), 1998, pp. 173-197
A class of asymptotically stable algorithms for learning-rate adaptation
S.M. Rüger
Algorithmica
22
(1-2), 1998, pp. 198-210
On a kernel-based method for pattern recognition, regression, approximation, and operator inversion
A.J. Smola
,
B. Schölkopf
Algorithmica
22
(1-2), 1998, pp. 211-231
A fully dynamic approximation scheme for shortest paths in planar graphs
P.N. Klein
,
S. Subramanian
Algorithmica
22
(3), 1998, pp. 235-249
Semidynamic algorithms for maintaining single-source shortest path trees
D. Frigioni
,
A. Marchetti-Spaccamela
,
U. Nanni
Algorithmica
22
(3), 1998, pp. 250-274
Maintaining spanning trees of small diameter
G.F. Italiano
,
R. Ramaswami
Algorithmica
22
(3), 1998, pp. 275-304
An incremental distributed algorithm for computing biconnected components in dynamic graphs
B. Swaminathan
,
K.J. Goldman
Algorithmica
22
(3), 1998, pp. 305-329
Maintaining regular properties dynamically in
k
-terminal graphs
G.N. Frederickson
Algorithmica
22
(3), 1998, pp. 330-350
Lower bounds for fully dynamic connectivity problems in graphs
M.R. Henzinger
,
M.L. Fredman
Algorithmica
22
(3), 1998, pp. 351-362
Philippe Flajolet's research in analysis of algorithms and combinatorics
H. Prodinger
,
W. Szpankowski
Algorithmica
22
(4), 1998, pp. 366-387
A Metropolis-type optimization algorithm on the infinite tree
D. Aldous
Algorithmica
22
(4), 1998, pp. 388-412
The complete solution of the competitive rank selection problem
F.T. Bruss
,
M. Drmota
,
G. Louchard
Algorithmica
22
(4), 1998, pp. 413-447
Packing random intervals on-line
E.G., Jr. Coffman
,
L. Flatto
,
P. Jelenković
,
B. Poonen
Algorithmica
22
(4), 1998, pp. 448-476
A note on point location in Delaunay triangulations of random points
L. Devroye
,
E.P. Mücke
,
Binhai Zhu
Algorithmica
22
(4), 1998, pp. 477-482
Average-case analysis of the merging algorithm of Hwang and Lin
W. Fernandez de la Vega
,
A.M. Frieze
,
M. Santha
Algorithmica
22
(4), 1998, pp. 483-489
On the analysis of linear probing hashing
P. Flajolet
,
P. Poblete
,
A. Viola
Algorithmica
22
(4), 1998, pp. 490-515
Seiten 1
2
>