Concept

Forcing

Publications associées (12)

Low-Rank Subspaces for Unsupervised Entity Linking

Robert West, Akhil Arora, Alberto Garcia Duran

Entity linking is an important problem with many applications. Most previous solutions were designed for settings where annotated training data is available, which is, however, not the case in numerous domains. We propose a light-weight and scalable entity ...

ASSOC COMPUTATIONAL LINGUISTICS-ACL2021

A data-driven method for reconstructing and modelling social interactions in moving animal groups

Francesco Mondada, Frank Bonnet, Vaios Papaspyros

Group-living organisms that collectively migrate range from cells and bacteria to human crowds, and include swarms of insects, schools of fish, and flocks of birds or ungulates. Unveiling the behavioural and cognitive mechanisms by which these groups coord ...

2020

The PCL Theorem: Transactions cannot be Parallel, Consistent, and Live

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We establish a theorem called the PCL theorem, which states that it is impossible to design a transactional memory algorithm that ensures (1) parallelism, i.e., transactions do not need to synchronize unless they access the same application objects, (2) ve ...

ASSOC COMPUTING MACHINERY2019

Architecture Diagrams: A Graphical Language for Architecture Style Specification

Joseph Sifakis, Simon Bliudze, Anastasia Mavridou, Eduard Baranov

Architecture styles characterise families of architectures sharing common characteristics. We have recently proposed configuration logics for architecture style specification. In this paper, we study a graphical notation to enhance readability and easiness ...

Open Publ Assoc2016

Architecture Diagrams - A Graphical Language for Architecture Style Specification

Joseph Sifakis, Simon Bliudze, Anastasia Mavridou, Eduard Baranov

Architecture styles characterise families of architectures sharing common characteristics. We have recently proposed configuration logics for architecture style specification. In this technical report, we study a graphical notation to enhance readability a ...

2016

The PCL Theorem. Transactions cannot be Parallel, Consistent and Live.

Rachid Guerraoui, Victor Bushkov, Panagiota Fatourou

We show that it is impossible to design a transactional memory system which ensures parallelism, i.e. transactions do not need to synchronize unless they access the same application objects, while ensuring very little consistency, i.e. a consistency condit ...

2014

Leptogenesis with heavy neutrino flavours: from density matrix to Boltzmann equations

Steve Blanchet

Leptogenesis with heavy neutrino flavours is discussed within a density matrix formalism. We write the density matrix equation, describing the generation of the matter-antimatter asymmetry, for an arbitrary choice of the right-handed (RH) neutrino masses. ...

Iop Publishing Ltd2013

A numerical model of the ankle to analyze joint prostheses

Valérie Parvex

The ankle is one of the most injured joint in the body. However, it remains a new field of study in biomedical orthopedics. With the increased life span, more people suffer from arthosis and joint problems. That is why the improvements done in arthroplasty ...

2012

Collective modes of coupled phase oscillators with delayed coupling

Andrew Charles Oates

We study the effects of delayed coupling on timing and pattern formation in spatially extended systems of dynamic oscillators. Starting from a discrete lattice of coupled oscillators, we derive a generic continuum theory for collective modes of long wavele ...

2012

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the p ...

2010

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