Search Results

Documents authored by Wozniakowski, Henryk

Document
DOI: 10.4230/DagRep.5.9.57
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)

Authors: Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, and Larisa Yaroslavtseva

Published in: Dagstuhl Reports, Volume 5, Issue 9 (2016)

Abstract
From 20.09.15 to 25.09.15, the Dagstuhl Seminar 15391 Algorithms and Complexity for Continuous Problems was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, participants presented their current research, and ongoing work and open problems were discussed. Abstracts or the presentations given during the seminar can be found in this report. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Aicke Hinrichs, Joseph F. Traub, Henryk Wozniakowski, and Larisa Yaroslavtseva. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391). In Dagstuhl Reports, Volume 5, Issue 9, pp. 57-76, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{hinrichs_et_al:DagRep.5.9.57,
  author =	{Hinrichs, Aicke and Traub, Joseph F. and Wozniakowski, Henryk and Yaroslavtseva, Larisa},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)}},
  pages =	{57--76},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{5},
  number =	{9},
  editor =	{Hinrichs, Aicke and Traub, Joseph F. and Wozniakowski, Henryk and Yaroslavtseva, Larisa},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.9.57},
  URN =		{urn:nbn:de:0030-drops-56854},
  doi =		{10.4230/DagRep.5.9.57},
  annote =	{Keywords: High Dimensional Problems, Tractability, Random coefficients, Multilevel algorithms, computational stochastic processes, Compressed sensing, Learning theory}
}
Document
DOI: 10.4230/DagSemProc.04401.14
Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting

Authors: Gregorz W. Wasilkowski and Henryk Wozniakowski

Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)

Abstract
We present polynomial-time algorithms for multivariate problems defined over tensor product spaces of finite order. That is, algorithms that solve the problem with error not exceeding \epsilon at cost bounded by C d^q \epsilon^{-1}, where d denotes the number of variables.
Cite as

Gregorz W. Wasilkowski and Henryk Wozniakowski. Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)

Copy BibTex To Clipboard

@InProceedings{wasilkowski_et_al:DagSemProc.04401.14,
  author =	{Wasilkowski, Gregorz W. and Wozniakowski, Henryk},
  title =	{{Polynomial-Time Algorithms for Multivariate Linear Problems with Finite-Order Weights; Worst Case Setting}},
  booktitle =	{Algorithms and Complexity for Continuous Problems},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{4401},
  editor =	{Thomas M\"{u}ller-Gronbach and Erich Novak and Knut Petras and Joseph F. Traub},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.14},
  URN =		{urn:nbn:de:0030-drops-1526},
  doi =		{10.4230/DagSemProc.04401.14},
  annote =	{Keywords: Multivariate integration , multivariate approximation , complexity , polynomial-time algorithms , finite-order weights}
}
Document
DOI: 10.4230/DagSemRep.101
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)

Authors: Stefan Heinrich, Joseph F. Traub, and Henryk Wozniakowski

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Stefan Heinrich, Joseph F. Traub, and Henryk Wozniakowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442). Dagstuhl Seminar Report 101, pp. 1-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1994)

Copy BibTex To Clipboard

@TechReport{heinrich_et_al:DagSemRep.101,
  author =	{Heinrich, Stefan and Traub, Joseph F. and Wozniakowski, Henryk},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9442)}},
  pages =	{1--22},
  ISSN =	{1619-0203},
  year =	{1994},
  type = 	{Dagstuhl Seminar Report},
  number =	{101},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.101},
  URN =		{urn:nbn:de:0030-drops-149891},
  doi =		{10.4230/DagSemRep.101},
}
Document
DOI: 10.4230/DagSemRep.11
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9116)

Authors: Erich Novak, Josef F. Traub, and Henryk Wozniakowski

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Erich Novak, Josef F. Traub, and Henryk Wozniakowski. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9116). Dagstuhl Seminar Report 11, pp. 1-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1991)

Copy BibTex To Clipboard

@TechReport{novak_et_al:DagSemRep.11,
  author =	{Novak, Erich and Traub, Josef F. and Wozniakowski, Henryk},
  title =	{{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 9116)}},
  pages =	{1--28},
  ISSN =	{1619-0203},
  year =	{1991},
  type = 	{Dagstuhl Seminar Report},
  number =	{11},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemRep.11},
  URN =		{urn:nbn:de:0030-drops-148998},
  doi =		{10.4230/DagSemRep.11},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact