Concept

Best, worst and average case

Publications associées (115)

Refined Quorum Systems

It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no contenti ...

2007

On Optimal Replication Group Splits in P2P Data Stores Based on the Hypercube

P2P data stores excel if availability of inserted data items must be guaranteed. Their inherent mechanisms to counter peer pop- ulation dynamics make them suitable for a wide range of application domains. This paper presents and analyzes the split maintena ...

GI2007

Multichannel thresholding with sensing dictionaries

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper shows introduces the use sensing dictionaries for p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We do both a worst case and average case recovery analyses of this ...

2007

Visual Focus of Attention Estimation from Head Pose Posterior Probability Distributions

Jean-Marc Odobez, Silèye Oumar Ba

We address the problem of recognizing the visual focus of attention (VFOA) of meeting participants from their head pose and contextual cues. The main contribution of the paper is the use of a head pose posterior distribution as a representation of the head ...

IDIAP2007

Robust checkers for self-calibrating designs

Frédéric Worm

So far, performance and reliability of circuits have been determined by worst-case characterisation of silicon and of environmental conditions such as noise and temperature. As nanometer technologies exacerbate process variations and reduce noise margins, ...

EPFL2006

Toward Online Probabilistic Path Replanning

Roland Siegwart, Björn Jensen, Roland Philippsen

In this talk we present work on sensor-based motion planning in initially unknown dynamic environments. Motion detection and probabilistic motion modeling are combined with a smooth navigation function to perform on-line path planning and replanning in clu ...

2006

Evolving Neural Controllers for Collective Robotic Inspection

Alcherio Martinoli

In this paper, an automatic synthesis methodology based on evolutionary computation is applied to evolve neural controllers for a homogeneous team of miniature autonomous mobile robots. Both feed-forward and recurrent neural networks can be evolved with fi ...

2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Marko Vukolic, Ron Levy

This paper establishes tight bounds on the best-case time-complexity of distributed atomic read/write storage implementations that tolerate worst-case conditions. We study asynchronous robust implementations where a writer and a set of reader processes (cl ...

2005

Approximations in Distributed Optimization

Boi Faltings, Adrian Petcu

We present in this paper an approximative method for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation method and requires a linear number of messages. The largest message is in the worst c ...

2005

Gracefully Degrading Fair Exchange with Security Modules

Rachid Guerraoui, Gildas Avoine

The fair exchange problem is key to trading electronic items in systems of mutually untrusted parties. In modern variants of such systems, each party is equipped with a tamper proof security module. The security modules trust each other but can only commun ...

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