Publications associées à Name binding

Combination of dielectrophoretic and hydrodynamic traps for the controlled contact between cells or beads and application to adhesion assays

Multicellular organisms require very well organized and finely balanced cell-cell communication, adhesion and coordination to ensure the organisms homeostasis. These functions rely on specialized receptors placed at the cells membrane whose binding to thei ...

EPFL2023

Effects of item distinctiveness on the retrieval of objects and object-location bindings from visual working memory

Yury Markov

Visual working memory (VWM) is prone to interference from stored items competing for its limited capacity. Distinctiveness or similarity of the items is acknowledged to affect this competition, such that poor item distinctiveness causes a failure to discri ...

2022

The Unstoppable Rise of Computational Linguistics in Deep Learning

James Henderson

In this paper, we trace the history of neural networks applied to natural language understanding tasks, and identify key contributions which the nature of language has made to the development of neural network architectures. We focus on the importance of v ...

Association for Computational Linguistics2020

Squid: Type-Safe, Hygienic, and Reusable Quasiquotes

Christoph Koch, Amir Shaikhha, Lionel Emile Vincent Parreaux

Quasiquotes have been shown to greatly simplify the task of metaprogramming. This is in part because they hide the data structures of the intermediate representation (IR), instead allowing metaprogrammers to use the concrete syntax of the language they man ...

ACM2017

Programming language abstractions for mobile code

Stéphane Micheloud

Scala is a general-purpose programming language developed at EPFL. It combines the most important concepts found in object-oriented and functional languages. Scala is a statically typed language; in particular it features an advanced type system and suppor ...

EPFL2009

Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming

Matteo Salani

We present an exact optimization algorithm for the Orienteering Problem with Time Windows (OPTW). The algorithm is based on bi-directional and bounded dynamic programming with decremental state space relaxation. We compare different strategies proposed in ...

2009