Publication

Computation Observability Regions for Discrete-time Hybrid Systems

Related publications (32)

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.

Function Computation over Networks

Chien-Yi Wang

This thesis looks at efficient information processing for two network applications: content delivery with caching and collecting summary statistics in wireless sensor networks. Both applications are studied under the same paradigm: function computation ove ...

EPFL2015

Protecting Circuits From Computationally Bounded And Noisy Leakage

Sebastian Faust

Physical computational devices leak side-channel information that may, and often does, reveal secret internal states. We present a general transformation that compiles any circuit into a circuit with the same functionality but resilience against well-defin ...

Siam Publications2014

Interactive Function Computation

Michael Christoph Gastpar

We investigate the role of interaction for computa- tion problem settings where nodes intend to compute functions of the raw messages generated at other nodes. In this work, we make some progress on a more elementary research component: feedback. Specifica ...

2013

Linear Function Computation in Networks: Duality and Constant Gap Results

Michael Christoph Gastpar

In linear function computation, multiple source nodes communicate across a relay network to a single destination whose goal is to recover linear functions of the original source data. When the relay network is a linear deterministic network, a duality rela ...

Institute of Electrical and Electronics Engineers2013

Computation over Gaussian networks with orthogonal components

Michael Christoph Gastpar, Chien-Yi Wang

Function computation of arbitrarily correlated discrete sources over Gaussian networks with multiple access components but no broadcast is studied. Two classes of functions are considered: the arithmetic sum function and the frequency histogram function. T ...

2013

Ultra high-speed electronics for power system dynamic emulation

Laurent Fabre

Modern society is dependent on reliable electricity for security, health, communication, transportation, finance, computers and nearly all aspects of the contemporary life. Providing reliable electricity is a very complex challenge. It involves real-time m ...

EPFL2013

On Synthesis for Unbounded Bit-vector Arithmetic

Viktor Kuncak, Andrej Spielmann

We propose to describe computations using QFPAbit, a language of quantifier-free linear arithmetic on unbounded integers with bitvector operations. Given a QFPAbit formula with input and output variables, we describe an algo- rithm that generates an effici ...

2012

Power Quality Application of Hybrid Drivetrain

Hardi Hõimoja

This paper presents a study on the power conditioning features of hybrid powertrain, especially regarding diesel-electric locomotives. Equipped with an embarked energy buffer for diesel generator support and utility grid interface, such a locomotive can be ...

2012

Wavelet-Regularized Reconstruction for Rapid MRI

Michaël Unser, Dimitri Nestor Alice Van De Ville, Cédric René Jean Vonesch, Matthieu Guerquin-Kern, Jean-Charles Baritaux

We propose a reconstruction scheme adapted to MRI that takes advantage of a sparsity constraint in the wavelet domain. We show that artifacts are significantly reduced compared to conventional reconstruction methods. Our approach is also competitive with ...

IEEE2009

M-DPOP: Faithful distributed implementation of efficient social choice problems

Boi Faltings, Adrian Petcu, David C. Parkes

In the efficient social choice problem, the goal is to assign values, subject to side constraints, to a set of variables to maximize the total utility across a population of agents, where each agent has private information about its utility function. In th ...

2008