Publication

Tracking Atoms with Particles for Audio-visual Source Localization

Related publications (72)

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.

On the complexity of fixed parameter clique and dominating set

Friedrich Eisenbrand

We provide simple, faster algorithms for the detection of cliques and dominating sets of fixed order. Our algorithms are based on reductions to rectangular matrix multiplication. We also describe an improved algorithm for diamonds detection. © 2004 Elsevie ...

2004

The Overhead of Consensus Failure Recovery

Rachid Guerraoui, Partha Dutta

Many reliable distributed systems are consensus-based and typically operate under two modes: a fast normal mode in failure-free periods, and a slower recovery mode following failures. A lot of work has been devoted to optimizing the normal mode, but little ...

2004

Survivable MApping Algorithm by Ring Trimming (SMART) for large IP-over-WDM networks

Patrick Thiran, Maciej Kurant

We develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; we call it SMART. A number of algorithms solving this problem can be found in th ...

2004

Early Local Decisions in Distributed Agreement

Rachid Guerraoui, Bastian Pochon, Partha Dutta

When devising a distributed agreement algorithm, it is common to minimize the time complexity of global decisions, which is typically measured as the number of communication rounds needed for all correct processes to decide. In practice, what we might want ...

2003

Constraint-Based Mining of Sequential Patterns over Datasets with Consecutive Repetitions

Marion Leleu

onstraint-based mining of sequential patterns is an active research area motivated by many application domains. In practice, the real sequence datasets can present consecutive repetitions of symbols (e.g., DNA sequences, discretized stock market data) that ...

Springer2003

A Mixed-State I-Particle Filter for Multi-Camera Speaker Tracking

Daniel Gatica-Perez, Jean-Marc Odobez, Guillaume Lathoud

Tracking speakers in multi-party conversations represents an important step towards automatic analysis of meetings. In this paper, we present a probabilistic method for audio-visual (AV) speaker tracking in a multi-sensor meeting room. The algorithm fuses ...

IDIAP2003

A Mixed-State I-Particle Filter for Multi-Camera Speaker Tracking

Daniel Gatica-Perez, Jean-Marc Odobez, Guillaume Lathoud

2003

Scalable and Adaptive Load Balancing on IBM PowerNP

Web and other Internet-based server farms are a critical company resource. A solution to the increased complexity of server farms and to the need to improve the server performance in terms of scalability, fault tolerance and management is to implement a lo ...

2002

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

Fault location algorithms for optical networks

Today, there is no doubt that optical networks are the solution to the explosion of Internet traffic that two decades ago we only dreamed about. They offer high capacity with the use of Wavelength Division Multiplexing (WDM) techniques among others. Howeve ...

EPFL2000