Publications associées à Langage algébrique

Special termination for log canonical pairs

We prove the special termination for log canonical pairs and its generalisation in the context of generalised pairs. ...

Int Press Boston, Inc2023

E-Scan: Consuming Contextual Data with Model Plugins

Anastasia Ailamaki, Viktor Sanca

Extracting value and insights from increasingly heterogeneous data sources involves multiple systems combining and consuming the data. With multi-modal and context-rich data such as strings, text, videos, or images, the problem of standardizing the data mo ...

2023

A Research-Practice Partnership to Introduce Computer Science in Secondary School: Lessons from a Pilot Program

Francesco Mondada, Helena Kovacs, Jean-Philippe Pellet, Jessica Elke Dehler Zufferey, Barbara Bruno, Laila Abdelsalam El-Hamamsy

Context: Introducing Computer Science (CS) into formal education can be challenging, notably when considering the numerous stakeholders involved which include the students, teachers, schools, and policy makers. We believe these perspectives should be con ...

2023

Method for Design Materialization (MDM) for artists, educators and archivists: an introduction

This contribution argues for the potential of Barr, Khaled and Lessard’s Method for Design Materialization (MDM) as a research through design tool that is specifically suited for new media preservation. Building moreover from the ISEA first and second Summ ...

2023

Updates on Hydrogen Value Chain: A Strategic Roadmap

Michael Graetzel, Dan Ren

A strategic roadmap for noncarbonized fuels is a global priority, and the reduction of carbon dioxide emissions is a key focus of the Paris Agreement to mitigate the effects of rising temperatures. In this context, hydrogen is a promising noncarbonized fue ...

WILEY-V C H VERLAG GMBH2023

On double-descent in uncertainty quantification in overparametrized models

Florent Gérard Krzakala, Lenka Zdeborová, Lucas Andry Clarte, Bruno Loureiro, Bruno Loureiro

Uncertainty quantification is a central challenge in reliable and trustworthy machine learning. Naive measures such as last-layer scores are well-known to yield overconfident estimates in the context of overparametrized neural networks. Several methods, ra ...

PMLR Proceedings of Machine Learning Research2023

Between the Pattern and the Type: A short parallel story

Vasileios Chanis

Historically speaking, the notion of the type was reintroduced to the larger architectural discourse as a direct consequence of the crisis of the Modern. The task of revisiting the forms of the past also dictated the return of architectural methods that ha ...

2023

In the Quest for Meaning: Revisiting Modernism’s debate around non-pedigreed architecture

Vasileios Chanis

In architectural historiography, it is widely accepted that in the aftermath of WWII, Modern Architecture found itself in the trouble of redefining its quest, its meaning, and its purpose; a crisis of the Modern before the Post-Modern. Thus, in this partic ...

2022

Lower Bounds for Unambiguous Automata via Communication Complexity

Mika Tapani Göös, Weiqiang Yuan

We use results from communication complexity, both new and old ones, to prove lower bounds for unambiguous finite automata (UFAs). We show three results. 1) Complement: There is a language L recognised by an n-state UFA such that the complement language ̅L ...

Schloss Dagstuhl - Leibniz-Zentrum für Informatik2022

Lie groups as permutation groups: Ulam's problem in the nilpotent case

Nicolas Monod

Ulam asked whether every connected Lie group can be represented on a countable structure. This is known in the linear case. We establish it for the first family of non-linear groups, namely in the nilpotent case. Further context is discussed to illustrate ...

WALTER DE GRUYTER GMBH2022