Concept

Common law

Publications associées (41)

Technosignatures Longevity and Lindy's Law

The probability of detecting technosignatures (i.e., evidence of technological activity beyond Earth) increases with their longevity, or the time interval over which they manifest. Therefore, the assumed distribution of longevities has some bearing on the ...

Bristol2024

Voices from the Frontline: Revealing the AI Practitioners' viewpoint on the European AI Act

Kathrin Grosse

Artificial intelligence (AI) is increasingly used in an ever larger number of industries. Alongside this development, however, abundant works argue that AI-driven systems are lacking in terms of safety, ethics and transparency. As a direct consequence, the ...

2024

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2023

How Words Move Hearts: Interpretable Machine Learning Models of Bias, Engagement, and Influence in Socio-Political Systems

Aswin Suresh

We study socio-political systems in representative democracies. Motivated by problems that affect the proper functioning of the system, we build computational methods to answer research questions regarding the phenomena occurring in them. For each phenomen ...

EPFL2023

The long cross-over dynamics of capillary imbibition

Ignacio Pagonabarraga Mora

Spontaneous capillary imbibition is a classical problem in interfacial fluid dynamics with a broad range of applications, from microfluidics to agriculture. Here we study the duration of the cross-over between an initial linear growth of the imbibition fro ...

CAMBRIDGE UNIV PRESS2022

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Rachid Guerraoui, Jovan Komatovic, Pierre Philippe Civit, Vincent Gramoli, Seth Gilbert

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

IEEE2022

War of Words II: Enriched Models of Law-Making Processes

Patrick Thiran, Matthias Grossglauser, Victor Kristof, Aswin Suresh

The European Union law-making process is an instance of a peer- production system. We mine a rich dataset of law edits and intro- duce models predicting their adoption by parliamentary committees. Edits are proposed by parliamentarians, and they can be in ...

ACM2021

Publish your thesis while respecting copyright rules

Marjorie Platon, Manon Velasco

It is very common to reuse published (or unpublished) content in a thesis (e.g. in the case of the theses made of a compilation of published articles). It is therefore important to ensure that the use (or reuse) is possible and to ask for authorizations fr ...

2021

War of Words: The Competitive Dynamics of Legislative Processes

Patrick Thiran, Matthias Grossglauser, Victor Kristof

A body of law is an example of a dynamic corpus of text documents that are jointly maintained by a group of editors who compete and collaborate in complex constellations. Our goal is to develop predictive models for this process, thereby shedding light on ...

ACM / IW3C2 (International World Wide Web Conference Committee)2020

From the Principle of Inertia to the Death Drive: The Influence of the Second Law of Thermodynamics on the Freudian Theory of the Psychical Apparatus

Pierre Magistretti, Jean-Philippe Ansermet

In the Freudian theory of the psychical apparatus, the introduction from the 1920s onward of the second drive dualism appears as a major turning point. The idea of a "death drive," first expressed in Beyond the Pleasure Principle (Freud, 1920), is generall ...

2020

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search