Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Thomas Müller-Gronbach, Leszek Plaskota, and Joseph F. Traub. 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{mullergronbach_et_al:DagSemProc.09391.1, author = {M\"{u}ller-Gronbach, Thomas and Plaskota, Leszek and Traub, Joseph F.}, title = {{09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--23}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.1}, URN = {urn:nbn:de:0030-drops-23005}, doi = {10.4230/DagSemProc.09391.1}, annote = {Keywords: Computational complexity of continuous problems, partial information, high-dimensional problems, tractability analysis, quasi-Monte Carlo methods, op operator equations, non-linear approximation, stochastic computation, ill posed-problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Discrepancy Bounds for Mixed Sequences. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.2, author = {Gnewuch, Michael}, title = {{Discrepancy Bounds for Mixed Sequences}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--4}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.2}, URN = {urn:nbn:de:0030-drops-22975}, doi = {10.4230/DagSemProc.09391.2}, annote = {Keywords: Star Discrepancy, Mixed Sequence, Hybrid Method, Monte Carlo, Quasi-Monte Carlo, Probabilistic Bounds} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Fred J. Hickernell, Thomas Müller-Gronbach, Ben Niu, and Klaus Ritter. Evaluating Expectations of Functionals of Brownian Motions: a Multilevel Idea. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{hickernell_et_al:DagSemProc.09391.3, author = {Hickernell, Fred J. and M\"{u}ller-Gronbach, Thomas and Niu, Ben and Ritter, Klaus}, title = {{Evaluating Expectations of Functionals of Brownian Motions: a Multilevel Idea}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.3}, URN = {urn:nbn:de:0030-drops-22987}, doi = {10.4230/DagSemProc.09391.3}, annote = {Keywords: Brownian motions, multilevel, option pricing, worst-case error} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Krzysztof Sikorski, Bhagirath Addepalli, E. R. Pardyjak, and M. Zhdanov. Quasi-Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{sikorski_et_al:DagSemProc.09391.4, author = {Sikorski, Krzysztof and Addepalli, Bhagirath and Pardyjak, E. R. and Zhdanov, M.}, title = {{Quasi-Monte Carlo, Monte Carlo, and regularized gradient optimization methods for source characterization of atmospheric releases }}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--19}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.4}, URN = {urn:nbn:de:0030-drops-22998}, doi = {10.4230/DagSemProc.09391.4}, annote = {Keywords: Atmospheric source problem, Gaussian Plume Model, Quasi Monte Carlo method, gradient optimization} }
Published in: Dagstuhl Seminar Proceedings, Volume 9391, Algorithms and Complexity for Continuous Problems (2009)
Michael Gnewuch. Weighted L_2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 9391, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
@InProceedings{gnewuch:DagSemProc.09391.5, author = {Gnewuch, Michael}, title = {{Weighted L\underline2 B Discrepancy and Approximation of Integrals over Reproducing Kernel Hilbert Spaces}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--9}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2009}, volume = {9391}, editor = {Thomas M\"{u}ller-Gronbach and Leszek Plaskota and Joseph. F. Traub}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09391.5}, URN = {urn:nbn:de:0030-drops-22966}, doi = {10.4230/DagSemProc.09391.5}, annote = {Keywords: Discrepancy, Numerical Integration, Quasi-Monte Carlo, Reproducing Kernel Hilbert Space} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Leszek Plaskota. Information-Based Nonlinear Approximation: An Average Case Setting. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, p. 1, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{plaskota:DagSemProc.04401.5, author = {Plaskota, Leszek}, title = {{Information-Based Nonlinear Approximation: An Average Case Setting}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--1}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.5}, URN = {urn:nbn:de:0030-drops-1504}, doi = {10.4230/DagSemProc.04401.5}, annote = {Keywords: average case setting , nonlinear approximation , information-based comlexity} }
Feedback for Dagstuhl Publishing