DagRep.5.9.57.pdf
- Filesize: 1.1 MB
- 20 pages
Document
Algorithms and Complexity for Continuous Problems (Dagstuhl Seminar 15391)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 9
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-01-19
Cite AsGet BibTex
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)
https://doi.org/10.4230/DagRep.5.9.57
https://doi.org/10.4230/DagRep.5.9.57
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.
Keywords
- High Dimensional Problems
- Tractability
- Random coefficients
- Multilevel algorithms
- computational stochastic processes
- Compressed sensing
- Learning theory
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads