Concept

Asymptotically optimal algorithm

Publications associées (55)

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

On the Message Complexity of Indulgent Consensus

Rachid Guerraoui, Seth Gilbert

Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...

Springer2007

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

This paper proposes a tree-based pursuit algorithm that efficiently trades off complexity and approximation performance for overcomplete signal expansions. Finding the sparsest representation of a signal using a redundant dictionary is, in general, a NP-Ha ...

2006

Tree-Based Pursuit: Algorithm and Properties

Pascal Frossard, Pierre Vandergheynst, Philippe Jost

2005

Efficient String Matching Algorithms for Combinatorial Universal Denoising

Suhas Diggavi, Sanket Dusad

Inspired by the combinatorial denoising method {\tt DUDE} \cite{WOSVW04}, we present efficient algorithms for implementing this idea for arbitrary contexts or for using it within subsequences. We also propose effective, efficient denoising error estimators ...

2005

Asymptotical Analysis of Timing Imperfections in UWB Receivers

Pierre-André Farine, Cyril Botteron, John Farserotu

Abstract—In this paper, a model is proposed to analyze the influence of timing imperfections on ultra-wide bandwidth (UWB) time-hopping spread-spectrum (TH-SS) signaling schemes, where N pulses are coherently added to increase the received signal-tonoise r ...

2004

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

Consider a set of correlated sources located at the nodes of a network, and a sink to which the data from all the sources has to arrive. We address the minimization of a separable joint communication cost function given by the product [rate]

\times

[edge ...

2004

Mathematical Properties of the JPEG2000 Wavelet Filters

Michaël Unser, Thierry Blu

The LeGall 5⁄3 and Daubechies 9⁄7 filters have risen to special prominence because they were selected for inclusion in the JPEG2000 standard. Here, we determine their key mathematical features: Riesz bounds, order of approximation, and regularity (Hölder a ...

IEEE2003

Moving Horizon Estimation for Hybrid Systems

Giancarlo Ferrari Trecate

We propose a state smoothing algorithm for hybrid systems based on Moving Horizon Estimation (MHE) by exploiting the equivalence between hybrid systems modeled in the Mixed Logic Dynamical form and piecewise affine systems. We provide sufficient conditions ...

2002

Moving Horizon Estimation for Hybrid Systems

Giancarlo Ferrari Trecate

1999

Decoding algebraic geometric codes

Mohammad Amin Shokrollahi

The past few years have witnessed exciting discoveries in different areas of coding theory and computational number theory. The present monograph, which exhibits the author's "Habilitationsschrift," is a collection of five different topics dealing with the ...

1998

Scaling Laws for Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

\times

[edge ...

2004