Publications related to Amortized analysis

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

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

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

Flow faster: efficient decision algorithms for probabilistic simulations

Friedrich Eisenbrand

Abstraction techniques based on simulation relations have become an important and effective proof technique to avoid the infamous state space explosion problem. In the context of Markov chains, strong and weak simulation relations have been proposed ((B. J ...

2007

A profiling framework for high level design space exploration for memory and system architectures

In 1971, the first microprocessor produced in mass production had 2300 transistor and was able to compute 60'000 operations per second at 740 kHz. Nowadays, even a common gaming console uses a central unit including 243 millions of transistors running at 4 ...

EPFL2007

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

Automatic Tracking of Particles in Dynamic Fluorescence Microscopy

Michaël Unser, Daniel Sage

We present a new, robust algorithm for tracking fluorescent particles in dynamic image sequences obtained by brightfield or confocal microscopy. Specifically, we consider the problem of extracting the movement of chromosomal telomeres within the nucleus of ...

EURASIP2003

Building models of real-time systems from application software

Joseph Sifakis

We present a methodology for building timed models of real-time systems by adding time constraints to their application software. The applied constraints take into account execution times of atomic statements, the behavior of the system's external environm ...

2003

Application of the code THEA to the CONDOPT experiment in SULTAN

Pierluigi Bruzzone, Luca Bottura

The CONDOPT (CONDuctor OPTimization) experiment has been recently completed in SULTAN. The current sharing behavior of Nb-3 Sn samples was assessed as a function of the number of cyclic loads experienced during current sweeps in a 10 T background field. We ...

2002

Maintaining minimum spanning forests in dynamic graphs

Monika Henzinger

We present the first fully dynamic algorithm for maintaining a minimum spanning forest in time o(sqrt(n)) per operation. To be precise, the algorithm uses O(n1/3 log n) amortized time per update operation. The algorithm is fairly simple and deterministic. ...

2001

Amortized analysis

Graph Chatbot

Chat with Graph Search

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

Average case analysis of multichannel thresholding

Average case analysis of multichannel sparse approximations using p- thresholding

Flow faster: efficient decision algorithms for probabilistic simulations

A profiling framework for high level design space exploration for memory and system architectures

Average Performance Analysis for Thresholding

Automatic Tracking of Particles in Dynamic Fluorescence Microscopy

Building models of real-time systems from application software

Application of the code THEA to the CONDOPT experiment in SULTAN

Maintaining minimum spanning forests in dynamic graphs

A profiling framework for high level design space exploration for memory and system architectures

Automatic Tracking of Particles in Dynamic Fluorescence Microscopy

Average case analysis of multichannel sparse approximations using p- thresholding

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

Average Performance Analysis for Thresholding

Average case analysis of multichannel thresholding

Application of the code THEA to the CONDOPT experiment in SULTAN

Flow faster: efficient decision algorithms for probabilistic simulations

Building models of real-time systems from application software

Maintaining minimum spanning forests in dynamic graphs