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=J. Complexity AND Volume=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower bounds for the complexity of linear functionals in the randomized setting
Erich Novak
,
Henryk Woźniakowski
Journal of Complexity
27
(1), 2011, pp. 1-22
Rigorous confidence bounds for MCMC under a geometric drift condition
Krzysztof Łatuszyński
,
Wojciech Niemiro
Journal of Complexity
27
(1), 2011, pp. 23-38
A unifying theorem for Newton's method on spaces with a convergence structure
Ioannis K. Argyros
,
Saïd Hilout
Journal of Complexity
27
(1), 2011, pp. 39-54
Optimal learning rates for least squares regularized regression with unbounded sampling
Cheng Wang
,
Ding-Xuan Zhou
Journal of Complexity
27
(1), 2011, pp. 55-67
Parameter choice methods using minimization schemes
F. Bauer
,
P. Mathé
Journal of Complexity
27
(1), 2011, pp. 68-85
Liberating the dimension for function approximation
G.W. Wasilkowski
,
H. Woźniakowski
Journal of Complexity
27
(1), 2011, pp. 86-110
Local convergence analysis of the Gauss-Newton method under a majorant condition
O.P. Ferreira
,
M.L.N. Gonçalves
,
P.R. Oliveira
Journal of Complexity
27
(1), 2011, pp. 111-125
On lower bounds for the
L_2
-discrepancy
Aicke Hinrichs
,
Lev Markhasin
Journal of Complexity
27
(2), 2011, pp. 127-132
Deterministic sampling of sparse trigonometric polynomials
Xu Zhiqiang
Journal of Complexity
27
(2), 2011, pp. 133-140
Complexity of approximation of functions of few variables in high dimensions
P. Wojtaszczyk
Journal of Complexity
27
(2), 2011, pp. 141-150
Lower complexity bounds for interpolation algorithms
Nardo Giménez
,
Joos Heintz
,
Guillermo Matera
,
Pablo Solernó
Journal of Complexity
27
(2), 2011, pp. 151-187
A consistent algorithm to solve Lasso, elastic-net and Tikhonov regularization
Ernesto De Vito
,
Veronica Umanità
,
Silvia Villa
Journal of Complexity
27
(2), 2011, pp. 188-200
On the widths of Sobolev classes
Hongwei Huang
,
Kunyang Wang
Journal of Complexity
27
(2), 2011, pp. 201-220
Dynamics of a higher-order family of iterative methods
Gerardo Honorato
,
Sergio Plaza
,
Natalia Romero
Journal of Complexity
27
(2), 2011, pp. 221-229
On the tensor rank of multiplication in any extension of
\mathbb F_2
Stéphane Ballet
,
Julia Pieltant
Journal of Complexity
27
(2), 2011, pp. 230-245
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time
Chèze Guillaume
Journal of Complexity
27
(2), 2011, pp. 246-262
On positive positive-definite functions and Bochner's theorem
Aicke Hinrichs
,
Jan Vybíral
Journal of Complexity
27
(3-4), 2011, pp. 264-272
Tractability of tensor product problems in the average case setting
Anargyros Papageorgiou
,
Iasonas Petras
Journal of Complexity
27
(3-4), 2011, pp. 273-280
Construction algorithms for higher order polynomial lattice rules
Jan Baldeaux
,
Josef Dick
,
Julia Greslehner
,
Friedrich Pillichshammer
Journal of Complexity
27
(3-4), 2011, pp. 281-299
On the randomized solution of initial value problems
Daun Thomas
Journal of Complexity
27
(3-4), 2011, pp. 300-311
Quasi-polynomial tractability
Michael Gnewuch
,
Henryk Woźniakowski
Journal of Complexity
27
(3-4), 2011, pp. 312-330
Deterministic multi-level algorithms for infinite-dimensional integration on
\mathbb R^N
Ben Niu
,
Fred J. Hickernell
,
Thomas Müller-Gronbach
,
Klaus Ritter
Journal of Complexity
27
(3-4), 2011, pp. 331-351
The randomized complexity of indefinite integration
Stefan Heinrich
,
Bernhard Milla
Journal of Complexity
27
(3-4), 2011, pp. 352-382
Complexity of numerical integration over spherical caps in a Sobolev space setting
Hesse Kerstin
Journal of Complexity
27
(3-4), 2011, pp. 383-403
A lower bound on complexity of optimization under the
r
-fold integrated Wiener measure
James M. Calvin
Journal of Complexity
27
(3-4), 2011, pp. 404-416
Seiten 1
2
>