Publications related to An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Solving the chemical master equation using sliding windows

Maria-Emanuela-Canini Mateescu, Verena Wolf, Rushil Goel

The chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in tim ...

BioMed Central2010

Real-time input-constrained MPC using fast gradient methods

Colin Neil Jones

Linear quadratic model predictive control (MPC) with input constraints leads to an optimization problem that has to be solved at every instant in time. Although there exists computational complexity analysis for current online optimization methods dedicate ...

IEEE2009

Abstractions for asynchronous distributed computing with malicious players

Marko Vukolic

In modern distributed systems, failures are the norm rather than the exception. In many cases, these failures are not benign. Settings such as the Internet might incur malicious (also called Byzantine or arbitrary) behavior and asynchrony. As a result, and ...

EPFL2008

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Murtuza Jadliwala

Localization in the presence of malicious beacon nodes is an important problem in wireless networks. Although significant progress has been made on this problem, some fundamental theoretical questions still remain unanswered: in the presence of malicious b ...

IEEE Computer Society2008

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Martin Vetterli, Patrick Thiran, Florence Bénézit, Patrick Denantes

Average consensus and gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. Inspired by heat diffusion, they compute the average of ...

Institute of Electrical and Electronics Engineers2008

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

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

Three Algorithms for Interface Synthesis: A Comparative Study

Vasu Singh, Dirk Thilo Beyer

A temporal interface for a system component is a finite automaton that specifies the legal sequences of input events. We evaluate and compare three different algorithms for automatically extracting the temporal interface from the transition graph of a comp ...

2006

An Average-Case Analysis for Rate-Monotonic Multiprocessor Real-time Scheduling

Graph Chatbot

Chat with Graph Search

Solving the chemical master equation using sliding windows

Real-time input-constrained MPC using fast gradient methods

Abstractions for asynchronous distributed computing with malicious players

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

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

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

Three Algorithms for Interface Synthesis: A Comparative Study

Towards a Theory of Robust Localization against Malicious Beacon Nodes

Which Distributed Averaging Algorithm Should I Choose for my Sensor Network?

Three Algorithms for Interface Synthesis: A Comparative Study

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

Abstractions for asynchronous distributed computing with malicious players

Average case analysis of multichannel thresholding

Real-time input-constrained MPC using fast gradient methods

Solving the chemical master equation using sliding windows

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

Average case analysis of multichannel sparse approximations using p- thresholding