Publication

Two Stage Estimation for the Echo Paths in Stereophonic Acoustic Echo Cancellation

Related publications (32)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Medial axis approximation from inner Voronoi balls: A demo of the Mesecina tool

Mark Pauly

We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general approximation method that builds on the same idea, namely, to approximate the ...

2007

Optimal control of mass transfer in peritoneal dialysis

Diego Mastalli

The aim of this work is to set up mathematical models and numerical methods to investigate the mass transfer process occurring during the peritoneal dialysis (PD) therapy. More precisely the final goal is the set up of tools to find for each patient submit ...

EPFL2006

Global mixed-integer dynamic optimization

Benoît Chachuat

Recent advances in process synthesis, design, operations, and control have created an increasing demand for efficient numerical algorithms for optimizing a dynamic system coupled with discrete decisions; these problems are termed mixed-integer dynamic opti ...

2005

Applying interchangeability techniques to the distributed breakout algorithm

Boi Faltings, Adrian Petcu

In this paper, we develop two methods for improving the performance of the standard Distributed Breakout Algorithm \cite{yokoo:dba} using the notion of interchangeability. We study the performance of this algorithm on the problem of distributed sensor netw ...

2004

A New Approach in Deterministic Global Optimisation of Problems with Ordinary Differential Equations

Benoît Chachuat

This paper presents an alternative approach to the deterministic global optimisation of problems with ordinary differential equations in the constraints. The algorithm uses a spatial branch-and-bound approach and a novel procedure to build convex underesti ...

Kluwer Academic Publishers2003

A Multi-Agent System for Integrating a Large-Scale Project

Boi Faltings, Carlos Eisenberg

This paper presents a multiagent-system for integrating AL-ICE: a real-life, distributed, large-scale particle physics experiment of the LHC project at CERN. The work is concerned with solving the large-scale coordination problem using a distributed constr ...

2003

Solving Agreement Problems with Weak Ordering Oracles

André Schiper, David Cavin, Fernando Pedone

Agreement problems, such as consensus, atomic broadcast, and group membership, are central to the implementation of fault-tolerant distributed systems. Despite the diversity of algorithms that have been proposed for solving agreement problems in the past y ...

2002

A New tool for the simulation of dynamic behaviour of hydroelectric power plants

François Avellan, Jean-Jacques Simond, Alain Sapin

An analytical approach allowing modelling transient phenomena in pipes, valves, surge tank and Francis turbines based on impedance method is developed. These models are introduced in a software called “SIMSEN”, which simulates the behaviour of complex appl ...

2001

Reliable and Total Order Broadcast in the Crash-Recovery Model

Rachid Guerraoui, Romain Boichat

This paper addresses the problem of broadcasting messages in a reliable and totally ordered manner when processes and channels may crash and recover, or crash and never recover. We present a suite of specifications of reliable and total order broadcast pri ...

2001

Algorithms and experiments: The new (and the old) methodology

Bernard Moret

The last twenty years have seen enormous progress in the design of algorithms, but little of it has been put into practice. Because many recently developed algorithms are hard to characterize theoretically and have large running_time coefficients, the gap ...

2001