Konferenzen  >  Informatik  >  Informationstheorie und Grundlagen der Informatik

Wählen Sie ein Land aus
ALLE LÄNDER (20)
1
ICGAIA-24 — International Conference on Generative AI and its Applications
22. Jul 2024 - 23. Jul 2024 • Jakarta, Indonesien
Veranstalter:
Core research Foundation
Zusammenfassung:
The International Conference on Generative AI and its Applications (ICGAIA) is a prestigious event that brings together researchers, practitioners, and experts from academia, industry, and government organizations to discuss the latest advancements, trends, and challenges in the field of generative artificial intelligence (AI) and its various applications.
Kontakt:
Tel.: [+91 9237388328];     Email: contact@nextgenaiconference.com
Themen:
Conference Highlights Generative Models and Architectures Generative AI for Creative Industries Generative Models for Data Augmentation and Synthesis Human-AI Collaboration and Interactive Systems Ethical and Societal Implications of Generative AI Evaluation and Benchmarking of Generative Models Industry Applications and Case Studies
Eintrags-ID:
1624042
2
ESSLLI 2024 — 35th EUROPEAN SUMMER SCHOOL IN LOGIC, LANGUAGE AND INFORMATION
29. Jul 2024 - 09. Aug 2024 • Leuven, Belgien
3
BIRS Workshop — Frontiers of Statistical Mechanics and Theoretical Computer Science
11. Aug 2024 - 16. Aug 2024 • Banff, Alberta, Kanada
Veranstalter:
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Eintrags-ID:
1559561
4
ISR 2024 — 14th International School on Rewriting
25. Aug 2024 - 01. Sep 2024 • Obergurgl, Österreich
Zusammenfassung:
Term rewriting is a powerful model of computation that underlies much of declarative programming and which is heavily used in symbolic computation in mathematics, theorem proving, and protocol verification. The 14th International School on Rewriting takes place at the University Center Obergurgl, Austria. The school is aimed at master and PhD students, researchers and practitioners interested in the study of rewriting concepts and their applications.
Eintrags-ID:
1617550
Verwandte Fachgebiete:
5
Trimester Program — Boolean Analysis in Computer Science
09. Sep 2024 - 18. Dez 2024 • Bonn, Deutschland
Veranstalter:
Hausdorff Research Institute for Mathematics (HIM)
Zusammenfassung:
The trimester program aims to bring together experts, postdocs, and students in computer science and certain areas in mathematics (analysis, probability, and combinatorics) in order to learn about some challenging open problems recently raised in computer science, to use and invent necessary new tools and techniques in mathematics to solve these challenging problems, and vice versa to learn and further extend methods developed in computer science to develop new directions in mathematics motivated by questions in computer science. The core topics of the trimester program would be: learning theory, complexity of classical and quantum algorithms, vector valued functions on the hypercube, complex Hypercontractivity, polynomial inequalities on the hypercube, and discrete approximation theory on the hamming cube.
Eintrags-ID:
1584049
6
Dagstuhl-Seminar — Algebraic and Analytic Methods in Computational Complexity
15. Sep 2024 - 20. Sep 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
Computational Complexity is concerned with the resources that are required for algorithms to detect properties of combinatorial objects and structures. It has often proven true that the best way to argue about these combinatorial objects is by establishing a connection (perhaps approximate) to a more well-behaved algebraic setting. Indeed, many of the deepest and most powerful results in Computational Complexity rely on algebraic proof techniques.
Eintrags-ID:
1589513
Verwandte Fachgebiete:
7
COMMA 2024 — 10th International Conference on Computational Models of Argument
18. Sep 2024 - 20. Sep 2024 • Hagen, Deutschland
Zusammenfassung:
The aim of the COMMA conference is to bring together researchers interested in computational models of argument and the representation of argumentation structures in natural language texts, including the problem of automatically discovering argumentation in text or speech. In addition to the main conference track, there will be thematically-focused workshops, system demonstrations, and a summer school with courses on current topics of argumentation.
Eintrags-ID:
1617686
8
Dagstuhl-Seminar — SAT and Interactions
13. Okt 2024 - 18. Okt 2024 • Schloss Dagstuhl, Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Zusammenfassung:
The problem of deciding whether a propositional formula is satisfiable (SAT) is one of the most fundamental problems in computer science, both theoretically and practically. Due to its practical implications, intensive research has been performed on how to solve SAT problems in an automated fashion, and SAT solving is now a ubiquitous tool to solve many hard problems, both from industry and mathematics. SAT is also increasingly being applied in logics that are not decidable, particularly in the context of first-order theorem proving. Here, fast SAT solvers are used for reasoning sub-tasks and for guiding the theorem provers. The main aim of this Dagstuhl Seminar is to bring together researchers from different areas of activity on SAT and researchers that work in the field of first-order theorem proving so that they can communicate state-of-the-art advances and embark on a systematic interaction that will enhance the synergy between the different areas.
Eintrags-ID:
1589441
Verwandte Fachgebiete:
9
On the Interfaces of Number Theory and Special functions with Computer Algebra,
29. Okt 2024 - 31. Okt 2024 • University of Monastir, Monastir, Tunesien
Veranstalter:
Faculty of Sciences of Monastir, University of Monastir, Monastir, Tunisia
Zusammenfassung:
The aim of this conference is to provide an overview of recent developments in number theory, special functions and computer algebra, covering the three topics separately as well as their interactions. This event will provide a collaborative and supportive research environment for young researchers and an opportunity for researchers to exchange ideas. Participants are strongly encouraged to give a talk within these topics.
Eintrags-ID:
1613902
Verwandte Fachgebiete:
10
Workshop — Analysis in TCS: testing, learning and complexity
04. Nov 2024 - 08. Nov 2024 • Bonn, Deutschland
Veranstalter:
The Hausdorff Research Institute for Mathematics (HIM)
Zusammenfassung:
Harmonic analysis on the hypercube has long found exciting applications in theoretical computer science, in areas as diverse as learning theory, voting theory, and computational complexity theory. And TCS has also inspired challenging new questions in analysis, often leading to new perspectives on familiar topics. Indeed, this connection is only deepening as quantum computing, machine learning, and other areas of TCS expand to spaces beyond the hypercube. Talks in this workshop will focus on such connections recently uncovered, techniques in use today, and conjectures old and new. We hope it can also be an invitation to the topic for a harmonic analysis audience, thanks to additional introductory talks scheduled.
Eintrags-ID:
1623211
Verwandte Fachgebiete:
11
Workshop — Information theory, Boolean functions and lattice problems
18. Nov 2024 - 22. Nov 2024 • Bonn, Deutschland
Veranstalter:
The Hausdorff Research Institute for Mathematics (HIM)
Zusammenfassung:
This workshop brings together leading experts in Boolean analysis, information theory, and lattices to explore the forefront of these disciplines through the talks and discussions about intriguing open problems, recent resolutions, and the evolution of innovative ideas, approaches, and techniques.
Eintrags-ID:
1623235
12
Dagstuhl-Seminar — Logic and Neural Networks
02. Feb 2025 - 07. Feb 2025 • Schloss Dagstuhl – Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Zusammenfassung:
Logic and learning are central to Computer Science, and in particular to AI-related research. Already Alan Turing envisioned in his 1950 “Computing Machinery and Intelligence” paper a combination of statistical (ab initio) machine learning and an “unemotional” symbolic language such as logic. The combination of logic and learning has received new impetus from the spectacular success of deep learning systems. The goal of this Dagstuhl Seminar is to bring together researchers from various communities related to utilizing logical constraints in deep learning and to create bridges between them via the exchange of ideas.
Eintrags-ID:
1626216
13
Dagstuhl-Seminar — Semirings in Databases, Automata, and Logic
16. Feb 2025 - 21. Feb 2025 • Schloss Dagstuhl – Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Zusammenfassung:
Semirings are fundamental algebraic structures that in recent times have found a number of applications to computer science, especially in the areas of databases and automata. On the side of databases, commercial query languages, such as SQL, use bag semantics, instead of set semantics, to evaluate relational database queries, which means that the semiring of the natural numbers is used to annotate tuples in the input and output relations. More generally, the annotations can be values in some fixed semiring; this gives a common generalization of both set semantics and bag semantics of database queries, and also makes it possible to model other situations in which one is interested, e.g., in the probability or the reliability of an answer. Furthermore, semirings of polynomials have been successfully used to carry out a rigorous study of provenance in databases. On the side of automata, semirings are used to define weighted automata, which are nondeterministic finite automata augmented with values from a semiring as weights on the transitions. These weights may model, e.g., the cost involved when executing a transition, the amount of resources or time needed for this, or the probability or reliability of its successful execution. Weighted automata have found numerous applications to natural language processing, speech recognition, and algorithms for digital image compression. These applications have inspired numerous investigations in the logic-in-computer-science community.
Eintrags-ID:
1626289
14
Dagstuhl-Seminar — Weihrauch Complexity: Structuring the Realm of Non-Computability
23. Mär 2025 - 28. Mär 2025 • Schloss Dagstuhl – Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Zusammenfassung:
This Dagstuhl Seminar is dedicated to the investigation of two active areas of research, one in theoretical computer science, the other in mathematical logic. These are computable analysis on the one hand, and reverse mathematics and applied computability theory on the other. That there is a deep connection between these areas was first suggested by Gherardi and Marcone (2008) and later independently by Dorais, Dzhafarov, Hirst, Mileti, and Shafer (2016) and Hirschfeldt and Jockusch (2016). The past decade has seen this connection blossom into a rich and productive area of research, with by now many papers and several PhD theses dedicated to it. Results in this area fall into two intertwined groups: Some clarify the structure of the degrees of non-computability; some further our understanding of the precise nature of non-computability of particular computational tasks of interest. Grasping the nature of non-computability is a profound goal mirroring the quest to understand the nature of computation. Knowing the degree of non-computability of a computational task brings with it answers as to whether weaker or approximate versions of it might be solvable. This interdisciplinary development was fostered not least by the two precursor Dagstuhl Seminars on this topic. The current seminar will explore recent trends and results, open questions, and new directions of this fascinating field of research that has become known as Weihrauch complexity.
Eintrags-ID:
1626693
15
Dagstuhl-Seminar — Categories for Automata and Language Theory
30. Mär 2025 - 04. Apr 2025 • Schloss Dagstuhl – Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Zusammenfassung:
Categorical methods have a long history in automata and language theory, but a coherent theory has started to emerge only in recent years. Some recent examples of categorical methods in automata theory include monadic, coalgebraic, functorial, fibrational and profinite approaches. Such an abstract viewpoint can provide a unifying perspective on various forms of automata; it can make it easier to bootstrap a theory in a new setting; and it provides conceptual clarity regarding which aspects and properties are fundamental and which are only coincidental. Due to being in its early stages, the field is currently still divided into several different communities with little connections between them. The purpose of this seminar is to connect these communities; to initiate collaborations; and to discuss recent developments and possible ways to go forward. The seminar will mix researchers of different backgrounds, in order to achieve a healthy balance between abstraction and applications in automata theory. We hope that the meeting will foster further interaction between the different communities. It should benefit category theorists, who may or may not have studied computation theory before, by inspiring them to look at problems motivated by automata and formal languages
Eintrags-ID:
1626702
16
CSTE 2025 — 2025 The 7th International Conference on Computer Science and Technologies in Education
18. Apr 2025 - 20. Apr 2025 • Wuhan, China
Veranstalter:
International Association of Computer Science and Information Technology
Zusammenfassung:
The 7th International Conference on Computer Science and Technologies in Education (CSTE 2025) will be held in Wuhan, China during April 18-20, 2025. CSTE 2025 is sposored by Central China Normal University, China, hosted by Faculty of Artificial Intelligence in Education, Central China Normal University, China.
Kontakt:
Email: aimee@iacsit.net
Themen:
Educational Technologies and Systems; Computer-supported Collaborative Learning and Social Computing; Artificial Intelligence in Education; STEM Education and Computational Thinking; Educational Data Mining and Learning Analytics; Innovative Technologies for Teaching and Learning;
Eintrags-ID:
1619773
17
Dagstuhl-Seminar — The Constraint Satisfaction Problem: Complexity and Approximability
18. Mai 2025 - 23. Mai 2025 • Schloss Dagstuhl – Wadern, Deutschland
Veranstalter:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH
Zusammenfassung:
The main aim of this Dagstuhl Seminar is to bring together leading researchers from all areas of activity in the theory of computation who use the constraint satisfaction paradigm, so that they can communicate state-of-the-art advances, share deep insights, and embark on a systematic interaction that will further develop the synergy between the different areas, generate new research avenues, and lead to fruitful attacks on the open problems in this area.
Eintrags-ID:
1626857
18
CCC 2025 — Computational Complexity Conference 2025
05. Aug 2025 - 08. Aug 2025 • Toronto, Ontario, Kanada
Veranstalter:
The Fields Institute for Research in Mathematical Sciences
Zusammenfassung:
The Copmutational Complexity Conference (CCC) aims to foster research in all areas of computational complexity theory, studying the absolute and relative power of computational models under resource constraints. Typical models include deterministic, nondeterministic, randomized, and quantum models; uniform and nonuniform models; Boolean, algebraic, and continuous models. Typical resource constraints involve time, space, randomness, program size, input queries, communication, and entanglement; worst-case as well as average case. Other, more specific, topics include: probabilistic and interactive proof systems, inapproximability, proof complexity, descriptive complexity, and complexity-theoretic aspects of cryptography and machine learning. The conference also encourages results from other areas of computer science and mathematics motivated by computational complexity theory.
Eintrags-ID:
1586348
19
New Mathematical Directions in Coding Theory
07. Sep 2025 - 12. Sep 2025 • Oberwolfach, Deutschland
Themen:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Eintrags-ID:
1605413
Verwandte Fachgebiete:
20
Combinatorics, Probability and Computing
14. Sep 2025 - 19. Sep 2025 • Oberwolfach, Deutschland
Themen:
Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)
Eintrags-ID:
1605445


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.

Kein Tracking | Keine Pop-ups | Keine Animationen
Stand vom 5. Juli 2024