Concept

Réécriture (informatique)

Publications associées (32)

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

, , ,

Most state-of-the-art approaches to image segmentation formulate the problem using Conditional Random Fields. These models typically include a unary term and a pairwise term, whose parameters must be carefully chosen for optimal performance. Recently, stru ...

2012

Decision Procedures for Automating Termination Proofs

Ruzica Piskac

Automated termination provers often use the following schema to prove that a program terminates: construct a relational abstraction of the program's transition relation and then show that the relational abstraction is well-founded. The focus of current too ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2011

Diffusion MR Image Segmentation: Towards Global Brain Connectivity Analysis

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Leila Cammoun, Xavier Gigandet

The exploration of the human connectome, a term denoting the global structural connectivity of the brain, is accessible to MRI at millimeter and centimeter scales. In this paper, we propose a methodology to map the connectome by constructing normalized who ...

Societa Editrice Esculapio-Progetto Leonardo, Via Umberto Terracini 30, Bologna, 40131, Italy2009

Diffusion Mr Image Segmentation: Towards Global Brain Connectivity Analysis

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Leila Cammoun, Xavier Gigandet

Societa Editrice Esculapio-Progetto Leonardo, Via Umberto Terracini 30, Bologna, 40131, Italy2009

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

Signal Reconstruction from Multiple Unregistered Sets of Samples using Groebner Bases

Martin Vetterli, Luciano Sbaiz, Patrick Vandewalle

We present a new method for signal reconstruction from multiple sets of samples with unknown offsets. We rewrite the reconstruction problem as a set of polynomial equations in the unknown signal parameters and the offsets between the sets of samples. Then, ...

2006

A typed intermediate language and algorithms for compiling scala by successive rewritings

Philippe Altherr

Scala is a general-purpose programming language developed at EPFL. It combines concepts coming from object-oriented languages with other ones coming from functional languages. Scala is strongly typed and comes with a relatively complex type system, which i ...

EPFL2006

Functional Nets

Martin Odersky

Foundational work on programming has been based traditionally on some variant of lambda calculus. This approach, while ideally suited to sequential programming, is increasingly at odds with modern programs which are reactive in their interfaces and concurr ...

1999

A Functional View of Join

Martin Odersky, Matthias Zenger

Join calculus, usually presented as a process calculus, is suitable as a foundation of both sequential and concurrent programming. We give a new operational semantics of join calculus, expressed as a reduction system with a single reduction rule similar to ...

1999

Rewriting Executable Files to Measure Program Behavior

James Richard Larus

Inserting instrumentation code in a program is an effective technique for detecting, recording, and measuring many aspects of a program's performance. Instrumentation code can be added at any stage of the compilation process by specially-modified system to ...

Wiley1994