Concept

Best, worst and average case

Related publications (115)

Stability and bounds in aggregate scheduling networks

We study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at ...

EPFL2008

A Scalable, Sound, Eventually-Complete Algorithm for Deadlock Immunity

George Candea, Horatiu Jula

We introduce the concept of deadlock immunity—a program's ability to avoid all deadlocks that match patterns of deadlocks experienced in the past. We present here an algorithm for enabling large software systems to automatically acquire such immunity witho ...

2008

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 ...

2008

Average case analysis of multichannel sparse approximations using p-thresholding - art. no. 67011X

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latter ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2007

Average case analysis of multichannel thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

2007

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We work out both worst case and average case recovery analyses of this algorithm and show that the latte ...

2007

Performance of Averaging Algorithms in Time-Varying Networks

Patrick Denantes

We study averaging algorithms in time-varying networks, and means tomeasure their performance. We present sufficient conditions on these algorithms, which ensure they lead to computation at each node, of the global average of measurements provided by each ...

2007

Average Performance Analysis for Thresholding

Pierre Vandergheynst, Karin Schnass

In this article is shown that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the {\it 2-Babel function} is growing slowly. This implies that it can succeed for sparsity levels up to ...

2007

Asymmetric Gaussian Multiple Descriptions and Asymmetric Multilevel Diversity Coding

Suhas Diggavi

We consider multiple description source coding problem with Gaussian source and mean squared error, for

K=3

descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively ref ...

2007

On the Cost of Modularity in Atomic Broadcast

André Schiper, Sergio Mena, Nils Richard Ekwall, Olivier Rütti

Modularity is a desirable property of complex software systems, since it simplifies code reuse, verification, maintenance, etc. However, the use of loosely coupled modules introduces a performance overhead. This overhead is often considered negligible, but ...

2007

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.

Average case analysis of multichannel sparse approximations using p- thresholding

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper introduces

p

2007

Asymmetric Gaussian Multiple Descriptions and Asymmetric Multilevel Diversity Coding

Suhas Diggavi

We consider multiple description source coding problem with Gaussian source and mean squared error, for

K=3

descriptions. We obtain an outer bound for the rate region of the problem. We also derive an inner bound for the problem based on successively ref ...

2007