Published in: Dagstuhl Reports, Volume 5, Issue 9 (2016)
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)
@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-dev.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} }
Published in: Dagstuhl Reports, Volume 2, Issue 9 (2013)
Alexander Keller, Frances Kuo, Andreas Neuenkirch, and Joseph F. Traub. Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391). In Dagstuhl Reports, Volume 2, Issue 9, pp. 200-225, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@Article{keller_et_al:DagRep.2.9.200, author = {Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.}, title = {{Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 12391)}}, pages = {200--225}, journal = {Dagstuhl Reports}, ISSN = {2192-5283}, year = {2013}, volume = {2}, number = {9}, editor = {Keller, Alexander and Kuo, Frances and Neuenkirch, Andreas and Traub, Joseph F.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.9.200}, URN = {urn:nbn:de:0030-drops-38920}, doi = {10.4230/DagRep.2.9.200}, annote = {Keywords: Computational complexity of continuous problems, Partial information, Biomedical learning problems, Random media, Computational finance, Noisy data, Tractability, Quantum computation, Computational stochastic processes, High-dimensional problems} }
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 6391, Algorithms and Complexity for Continuous Problems (2007)
Stephan Dahlke, Klaus Ritter, Ian H. Sloan, and Joseph F. Traub. 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{dahlke_et_al:DagSemProc.06391.1, author = {Dahlke, Stephan and Ritter, Klaus and Sloan, Ian H. and Traub, Joseph F.}, title = {{06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--21}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan 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.06391.1}, URN = {urn:nbn:de:0030-drops-8782}, doi = {10.4230/DagSemProc.06391.1}, annote = {Keywords: Computational complexity, partial information, high-dimensional problems, operator equations, non-linear approximation, quantum computation, stochastic computation, ill posed-problems} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Klaus Meer and Martin Ziegler. Real Computational Universality: The Word Problem for a class of groups with infinite presentation. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{meer_et_al:DagSemProc.06391.2, author = {Meer, Klaus and Ziegler, Martin}, title = {{Real Computational Universality: The Word Problem for a class of groups with infinite presentation}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--20}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan 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.06391.2}, URN = {urn:nbn:de:0030-drops-8773}, doi = {10.4230/DagSemProc.06391.2}, annote = {Keywords: Computational group theory, word problem, Blum-Shub-Smale model} }
Published in: Dagstuhl Seminar Proceedings, Volume 6391, Algorithms and Complexity for Continuous Problems (2007)
Howard Barnum. Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 6391, pp. 1-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)
@InProceedings{barnum:DagSemProc.06391.3, author = {Barnum, Howard}, title = {{Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--25}, series = {Dagstuhl Seminar Proceedings (DagSemProc)}, ISSN = {1862-4405}, year = {2007}, volume = {6391}, editor = {Stephan Dahlke and Klaus Ritter and Ian H. Sloan 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.06391.3}, URN = {urn:nbn:de:0030-drops-8769}, doi = {10.4230/DagSemProc.06391.3}, annote = {Keywords: Quantum query complexity semidefinite programming} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Abstracts Collection – Algorithms and Complexity for Continuous. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-21, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{mullergronbach_et_al:DagSemProc.04401.1, author = {M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.}, title = {{04401 Abstracts Collection – Algorithms and Complexity for Continuous}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--21}, 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.1}, URN = {urn:nbn:de:0030-drops-1545}, doi = {10.4230/DagSemProc.04401.1}, annote = {Keywords: Complexity and regularization of ill-posed problems , nonlinear approximation , tractability of high-dimensional numerical problems quantum computing , stochastic computation and quantization , global optimization , differential and integral equations} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Thomas Müller-Gronbach, Erich Novak, Knut Petras, and Joseph F. Traub. 04401 Summary – Algorithms and Complexity for Continuous Problems. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{mullergronbach_et_al:DagSemProc.04401.2, author = {M\"{u}ller-Gronbach, Thomas and Novak, Erich and Petras, Knut and Traub, Joseph F.}, title = {{04401 Summary – Algorithms and Complexity for Continuous Problems}}, 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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04401.2}, URN = {urn:nbn:de:0030-drops-1530}, doi = {10.4230/DagSemProc.04401.2}, annote = {Keywords: Complexity and Regularization of Ill-Posed Problems , Non-Linear Approximation , Tractability of High-Dimensional Numerical Problems Quasi-Monte Carlo Methods , Quantum Computing , Stochastic Computation and Quantization , Global Optimization , Differential and Integral Equation} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Dirk Nuyens and Ronald Cools. Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II). In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{nuyens_et_al:DagSemProc.04401.3, author = {Nuyens, Dirk and Cools, Ronald}, title = {{Fast Component-By-Component Construction of Rank-1 Lattice Rules for (Non-)Primes (Part II)}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--26}, 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.3}, URN = {urn:nbn:de:0030-drops-1486}, doi = {10.4230/DagSemProc.04401.3}, annote = {Keywords: numerical integration , cubature/quadrature , rank-1 lattice , component-by-component construction , fast algorithm} }
Published in: Dagstuhl Seminar Proceedings, Volume 4401, Algorithms and Complexity for Continuous Problems (2005)
Harald Luschgy and Gilles Pagès. Functional Quantization and Entropy for Stochastic Processes. In Algorithms and Complexity for Continuous Problems. Dagstuhl Seminar Proceedings, Volume 4401, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)
@InProceedings{luschgy_et_al:DagSemProc.04401.4, author = {Luschgy, Harald and Pag\`{e}s, Gilles}, title = {{Functional Quantization and Entropy for Stochastic Processes}}, booktitle = {Algorithms and Complexity for Continuous Problems}, pages = {1--15}, 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.4}, URN = {urn:nbn:de:0030-drops-1446}, doi = {10.4230/DagSemProc.04401.4}, annote = {Keywords: Functional quantization , entropy , product quantizers} }
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