Conférences  >  Informatique  >  Théorie de l'information, fondations de l'informatique

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

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.

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Mise en œuvre et applications de l'intelligence artificielle

Champalimaud Foundation

We aim to explore approaches based on neural networks and beyond, examining alternative AI methodologies that challenge and expand our current understanding of intelligence. The event will foster interdisciplinary discussions on innovative methods and ideas, including Physics-Inspired Machine Learning, new statistical approaches, Quantum Machine Learning, Bayesian Methods, Neurosymbolic Methods, Symbolic AI, Automated Theorem Proving, Probabilistic Programming Languages, Variational Methods, Algebraic Machine Learning, Category Theory applied to AI and Compressive Sensing.

Event Secretariat;     Email.: cr-events@research.fchampalimaud.org

AI, mathematics for AI, Physics-Inspired Machine Learning, Quantum Machine Learning, Automated Reasoning, Algebraic Machine Learning

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

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.

Génie logiciel,    Conception et gestion des bases de données, Moteurs de recherche et extraction de connaissances à pa

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

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.

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

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

International Association of Computer Science and Information Technology

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.

Email.: aimee@iacsit.net

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;

Réseaux de neurones et intelligence artificielle, apprentissage automatique,    Enseignement assisté par ordinateur

School of Computer Science and Technology

The 17th International Conference on Digital Image Processing (ICDIP 2025) will be held in Haikou, China during April 25-27, 2025, which is hosted by School of Computer Science and Technology, Hainan University, China; Center for Information Technology Services, Hainan University, China. Since 2009, the International Conference on Digital Image Processing (ICDIP) has been successfully held sixteen editions in Singapore, China, Greece, Japan and other countries and regions. So far, nearly two thousand experts and scholars from all over the world have participated in the conference, and nearly two hundred technical sessions have been held. After 16 years, ICDIP has established a strong industry expert committee.

Tél.: [+86-18080013977];     Email.: aimee@iacsit.net

Track 1: Image Understanding and Analysis ▪ Object Detection and Categorization ▪ Detection, Recognition, and Classification ▪ Image Acquisition ▪ Image Segmentation ▪ Image Scanning, Display, and Printing Track 2: Image and Video Processing ▪ Image & Video Analysis and Segmentation ▪ Image & Video Coding and Transmission ▪ Image and Video Compression ▪ Motion and Video Analysis ▪ Video Surveillance and Monitoring Track 3: Computer Vision and Graphics ▪ Computer Vision and Image Processing Applications ▪ Content-based Image Retrieval ▪ Sensing, Representation, and Modeling ▪ Stereoscopic, Multiview, and 3D Processing ▪ Multi-view Geometry Track 4: Signal Processing ▪ Digital Signal Processing ▪ Adaptive Signal Processing ▪ Statistical Signal Processing ▪ Time-frequency Signal Analysis ▪ Cyclo-stationary Signal Analysis Track 5: Applications and Systems ▪ Emerging Applications and Systems ▪ Applications in Telecommunications ▪ Document Image Processing ▪ Color, Multispectral, and Hyperspectral Imaging ▪ Data Mining Techniques Track 6: Medical and Biological Image Processing ▪ Medical Image Analysis ▪ Medical Image Processing ▪ Biomedical and Biological Image Processing ▪ Biometrics, Forensics, and Security ▪ Biomedical Imaging New and Emerging Applications For more topics, please visit: https://www.icdip.org/cfp.html

Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH

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.

Finite Geometry, Crptology, Algegraic Combinatorics, Coding Theory, Combinatorial Designs

Théorie des graphes et combinatoire,    Cryptographie, blockchain et sécurité de l'information

Optica

On the edge of a technology revolution, Quantum 2.0 refers to the development and use of quantum superposition and entanglement in large engineered systems. Examples of such large quantum systems include quantum computers and simulators, quantum communication networks and arrays of quantum sensors. New technologies will go far beyond the (quantum 1.0) capabilities offered by single systems.

Théorie de l'information quantique et informatique quantique,    Salons, foire-exposition

IEEE

The International Conference on Web Services (ICWS) has been a prime international forum for both researchers and industry practitioners to exchange the latest fundamental advances in the state of the art and practice of Web-based services, to identify emerging research topics, and to define the future of Web-based services. Areas include services modeling, development, publishing, discovery, recommendation, composition, testing, adaptation, and delivery, and Web services applications and standards.

Service Oriented Systems ● Service-Oriented Architecture (SOA) ● Service specification and modeling ● Service evolution ● Service Oriented Software Engineering methodologies ● Formal methods in services ● Micro-service and service mesh ● Software engineering for adaptive service-oriented systems ● Secure service lifecycle development ● Service ecosystems Services Discovery, Composition and Recommendation ● Service publishing and searching ● Automatic service composition ● Scientific workflows ● Business process integration and management ● Service coordination and cooperation ● Service-based data integration ● Data-driven service composition ● Knowledge-driven service composition ● Service orchestration and choreography for the future Internet ● Service recommendation Services QoS Management ● Quality-of-Service (QoS) modeling and management ● Service QoS evaluation and prediction ● Autonomic services ● Web services testing ● Performance aspects of cloud and service virtualization ● Service level agreements Services Security, Privacy and Trust ● Service security ● Privacy and trust ● Dependable and secure services ● Service auditing ● Service policy control ● Service regulation and governance Service Applications beyond the Web ● Web Services for the Internet of Things (IoT) ● Services in Cyber-Physical Systems (CPS) ● Social networks and services ● Cloud services ● Edge services ● Mobile web services ● Satellite service computing ● Communication services ● XaaS (everything as a service) ● Service-based processing and querying ● Service-based recommendation and prediction ● Crowdsourcing Services, Conversational Services ● Metaverse/VR/AR services ● Services for Artificial Intelligence ● (Smart) Cybersecurity services ● Other applications AI in Web Services ● Generative AI in Services ● Generative AI as a Service (GaaS) ● Generative AI for API Creation, Integration, testing, and Personalization ● Security and Privacy in Generative AI-Driven Systems ● LLM and Multimodal Models enhanced service discovery, selection, composition ● LLM-driven service recommendation: algorithms, models, and performance ● AI for service customization and personalization ● Machine/Deep learning powered service discovery ● Process mining, anomaly detection, and data processing methods for service composition ● Security and privacy in AI-enhanced service architectures ● Service Reasoning with Generative AI Approaches ● Reinforcement Learning and Transformer Models for Web Services ● Innovative Applications of Generative AI in Web Services ● Explainable AI in Web Services ● Human-in-the-Loop AI Systems Datasets & Benchmarking for Service Computing Community ● Development and sharing of standard datasets ● Establishment of reliable and meaningful benchmarks ● Techniques for dataset creation, pre-processing, curation, and management in service computing ● Novel methodologies for performance evaluation using established benchmarks Web 3.0 and Decentralized Services ● Web 3.0 services leveraging blockchain, smart contracts, and decentralized architectures ● Tustless service environments and decentralized applications (dApps) ● Interoperability and integration challenges in Web 3.0 services ● Service governance, policy enforcement, and legal implications in decentralized ecosystems ● Novel service offerings and revenue models for the Web 3.0 landscape Emerging Technologies for Advanced Service-Oriented Computing: Opportunities, Challenges, and Applications ● AI enabled services ● Quantum Service Computing ● Digital Twins ● 3D Printing/Additive Manufacturing Techniques ● Blockchain ● Robotic Process Automation (RPA) ● Chatbots and Virtual Assistants ● Low-Code / No-Code Solutions ● Virtual Reality (VR) and Augmented Reality (AR) ● Green IT ● 5G Technology ● Metaverse Services ● Industry 4.0

e-Business, Administration électronique, Logiciel en tant que service,    Sciences économiques, Entreprise et Marketing

The Fields Institute for Research in Mathematical Sciences

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.

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Mathematisches Forschungsinstitut Oberwolfach (MFO, Oberwolfach Research Institute for Mathematics)

Théorie des graphes et combinatoire,    Statistique, Théorie des jeux