Conference-Service.com stellt der Öffentlichkeit ein Kalendarium wichtiger Konferenzen, Symposien und sonstiger Tagungen im wissenschaftlich-technischen Bereich zur Verfügung.
Obwohl das Verzeichnis mit großer Sorgfalt zusammengestellt und ständig aktualisiert wird, weisen wir auf die Möglichkeit von Fehlern ausdrücklich hin. Bitte vergewissern Sie sich immer beim Veranstalter, bevor Sie über die Teilnahme oder Nichtteilnahme an einer Konferenz entscheiden.
| 3.APPROX'2013 — 16th. International Workshop on Approximation Algorithms for Combinatorial Optimization Problems |
| Termin | 21. Aug 2013 → 23. Aug 2013 | [ID=533362]  |
| Ort | Berkeley, Kalifornien, Vereinigte Staaten |
| Zusammenfassung | APPROX'2013 focuses on algorithmic and complexity theoretic issues relevant to the development of efficient approximate solutions to computationally difficult problems. |
| Webseite | http://cui.unige.ch/tcs/random-approx/2013/index.php |
| Verwandte Fachgebiete | Algorithmen |
| | |
| 4.ICERM Semester Program on "Network Science and Graph Algorithms" |
| Termin | 03. Feb 2014 → 09. Mai 2014 | [ID=517246]  |
| Ort | ICERM, Providence, Rhode Island, Vereinigte Staaten |
| Zusammenfassung | The study of computational problems on graphs has long been a central area of research in computer science. However, recent years have seen qualitative changes in both the problems to be solved and the tools available to do so. Application areas such as computational biology, the web, social networks, and machine learning give rise to large graphs and complex statistical questions that demand new algorithmic ideas and computational models. At the same time, techniques such as semidefinite programming and combinatorial preconditioners have been emerging for addressing these challenges. |
| Webseite | http://icerm.brown.edu/sp-s14 |
| Verwandte Fachgebiete | Kurse und Veranstaltungen für Studenten der Mathematik; Angewandte Mathematik: Komplexe Netzwerke |
| | |
| 5.ICERM Workshop: Semidefinite Programming and Graph Algorithms |
| Termin | 10. Feb 2014 → 14. Feb 2014 | [ID=541970]  |
| Ort | Providence, Vereinigte Staaten |
| Zusammenfassung | Semidefinite programming is playing an ever increasing role in many areas of computer science and mathematics, including complexity theory, approximation algorithms for hard graph problems, discrete geometry, machine learning, and extremal combinatorics. This workshop will bring together researchers from these different fields. The goal is to explore connections, learn and share techniques, and build bridges. |
| Webseite | http://icerm.brown.edu/sp-s14-w1 |
| Verwandte Fachgebiete | Kurse und Veranstaltungen für Studenten der Mathematik |
| | |
| 6.ICERM Workshop: Stochastic Graph Models |
| Termin | 17. Mär 2014 → 21. Mär 2014 | [ID=542015]  |
| Ort | Providence, Vereinigte Staaten |
| Zusammenfassung | Random graphs, stochastic processes on graphs and algorithms for computations on these structures continue to play a dominant role in algorithmic research and discrete mathematics, with recent applications ranging from web search and recommendation engines to social networks and system biology. This workshop will be an opportunity for researchers from diverse fields to get together and share problems and techniques for handling and analyzing graphs structures. The connections---mathematical, computational, and practical---that arise between these seemingly-diverse problems and approaches will be emphasized. |
| Webseite | http://icerm.brown.edu/sp-s14-w2 |
| Verwandte Fachgebiete | Kurse und Veranstaltungen für Studenten der Mathematik |
| | |
| 7.ICERM Workshop: Electrical Flows, Graph Laplacians, and Algorithms: Spectral Graph Theory and Beyond |
| Termin | 07. Apr 2014 → 11. Apr 2014 | [ID=541950]  |
| Ort | Providence, Vereinigte Staaten |
| Zusammenfassung | Spectral graph theory, which studies how the eigenvalues and eigenvectors of the graph Laplacian (and other related matrices) interact with the combinatorial structure of a graph, is a classical tool in both the theory and practice of algorithm design. The success of this approach has been rooted in the efficiency with which eigenvalues and eigenvectors can be computed, and in the surprisingly large number of ways that a graph's properties are connected to the Laplacian's spectrum---particularly to the value of its second smallest eigenvalue, ?2. However, while the eigenvalues and eigenvectors of the Laplacian capture a striking amount of the structure of the graph, they certainly do not capture all of it. Recent work in the field suggests that we have only scratched the surface of what can be done if we are willing to broaden our investigation to include more general linear-algebraic properties of the matrices we associate to graphs. A particularly fruitful example of this has been the study of Laplacian linear systems, where the interplay between linear algebra and graph theory has led to progress in both fields. On the one hand, researchers have used the combinatorial structure of the corresponding graphs to facilitate the solution of these linear systems, resulting in solvers that run in nearly-linear time. On the other hand, one can use these linear systems to describe the behavior of electrical flows on a graph, which has provided a powerful new primitive for algorithmic graph theory. This interaction has already led to improved algorithmic results for many of the basic problems in algorithmic graph theory, including finding maximum flows and minimum cuts, solving traveling salesman problems, sampling random trees, sparsifying graphs, computing multicommodity flows, and approximately solving a wide range of general clustering and partitioning problems. In addition, researchers have recently shown how to exploit a wide range of other algebraic properties of matrices associated to graphs, such as the threshold rank, cut norm, sensitivity to perturbation, or hypercontractivity of the eigenspaces, to achieve impressive algorithmic results. In this workshop, we will bring researchers together to study and advance this new emerging frontier in algorithmic graph theory. |
| Webseite | http://icerm.brown.edu/sp-s14-w3 |
| Verwandte Fachgebiete | Kurse und Veranstaltungen für Studenten der Mathematik |
| | |
| 8.FPSAC — 26th International Conference on Formal Power Series and Algebraic Combinatorics |
| Termin | 29. Jun 2014 → 03. Jul 2014 | [ID=488398]  |
| Ort | Chicago, IL, Vereinigte Staaten |
| Themen | Topics include all aspects of combinatorics and their relations with other parts of mathematics, physics, computer science, and biology. |
| Webseite | https://sites.google.com/site/fpsac2014/ |
| Kontakt | Bridget Tenner; Email: fpsac2014@gmail.com |
| | |
Stand vom 13. März 2013