Concept

Grammaire ambigüe

Publications associées (35)

Staged parser combinators for efficient data processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to b ...

ACM Press2014

Staged Parser Combinators for Efficient Data Processing

Martin Odersky, Tiark Rompf, Sandro Stucki, Manohar Jonnalagedda, Thierry Coppey

Assoc Computing Machinery2014

Gold-Free Ternary III-V Antimonide Nanowire Arrays on Silicon: Twin-Free down to the First Bilayer

Sonia Conesa Boj

With the continued maturation of III-V nanowire research, expectations of material quality should be concomitantly raised. Ideally, III-V nanowires integrated on silicon should be entirely free of extended planar defects such as twins, stacking faults, or ...

American Chemical Society2014

Deformable Surface 3D Reconstruction from Monocular Images

Pascal Fua, Mathieu Salzmann

Being able to recover the shape of 3D deformable surfaces from a single video stream would make it possible to field reconstruction systems that run on widely available hardware without requiring specialized devices. However, because many different 3D shap ...

Morgan-Claypool2010

Correctly defined concrete syntax

Due to their complexity, the syntax of modern modeling languages is preferably defined in two steps. The abstract syntax identifies all modeling concepts whereas the concrete syntax should clarify how these concepts are rendered by graphical and/or textual ...

Springer-Verlag2008

A formal approach to fault tolerant distributed consensus

Rachele Fuzzati

The term distributed Consensus denotes the problem of getting a certain number of processes, that could be far away from each other and that exchange messages through some communication means, to all agree on the same value. This problem has been proved im ...

EPFL2008

Modelling Human Perception of Facial Expressions by Discrete Choice Models

Michel Bierlaire, Jean-Philippe Thiran, Matteo Sorci, Javier Cruz Mota, Thomas Robin

Facial expression recognition is a hard and ambiguous problem in computer vision. It is hard due to the wide variety of faces and the wide variety of ways of representing the same expression. And it is ambiguous because, even though common approaches treat ...

2007

Modelling Human Perception of Facial Expressions by Discrete Choice Models

Michel Bierlaire, Matteo Sorci, Javier Cruz Mota, Thomas Robin

2007

Making Metamodels Aware of Concrete Syntax

Frédéric Fondement

Language-centric methodologies, triggered by the success of Domain Specific Languages, rely on precise specifications of modeling languages. While the definition of the abstract syntax is standardized by the 4-layer metamodel architecture of the OMG, most ...

2005

Grammar-Based Tree Compression

Grammar-based compression means to find a small grammar that generates a given object. Such a grammar reveals the structure of the object (according to the grammar formalism used); the main advantage of this compression method is that the resulting grammar ...

2004

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