Publications related to Protecting Circuits From Computationally Bounded And Noisy Leakage

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.

Metastable densities for the contact process on power law random graphs

Thomas Mountford, Daniel Rodrigues Valesin

We consider the contact process on a random graph with a fixed degree distribution given by a power law. We follow the work of Chatterjee and Durrett [2], who showed that for arbitrarily small infection parameter lambda, the survival time of the process is ...

Univ Washington, Dept Mathematics2013

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

In this work we consider the random discrete

L^2

projection on polynomial spaces (hereafter RDP) for the approximation of scalar quantities of interest (QOIs) related to the solution of a partial differential equation model with random input parameters. ...

Siam Publications2013

Robust Data-Driven Dynamic Programming

Daniel Kuhn, Grani Adiwena Hanasusanto

In stochastic optimal control the distribution of the exogenous noise is typically unknown and must be inferred from limited data before dynamic programming (DP)-based solution schemes can be applied. If the conditional expectations in the DP recursions ar ...

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

Compressible distributions for high-dimensional statistics

Volkan Cevher, Rémi Gribonval

We develop a principled way of identifying probability distributions whose independent and identically distributed realizations are compressible, i.e., can be well approximated as sparse. We focus on Gaussian compressed sensing, an example of underdetermin ...

Institute of Mathematical Statistics2012

A novel sampling theorem on the sphere

Yves Wiaux, Jason Douglas McEwen

We develop a novel sampling theorem on the sphere and corresponding fast algorithms by associating the sphere with the torus through a periodic extension. The fundamental property of any sampling theorem is the number of samples required to represent a ban ...

Institute of Electrical and Electronics Engineers2011

Fast adaptive uniformisation of the chemical master equation

Maria-Emanuela-Canini Mateescu, Verena Wolf

Within systems biology there is an increasing interest in the stochastic behaviour of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). ...

2010

Function computation over linear channels

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

We consider multiple non-colocated sources commu- nicating over a network to a common sink. We assume that the network operation is fixed, and its end result is to convey a fixed linear deterministic transformation of the source data to the sink. This line ...

2010

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Fabio Nobile, Giovanni Migliorati, Erik Gustaf Bogislaw Von Schwerin

In this work we consider the random discrete

L^2

Siam Publications2013

Protecting Circuits From Computationally Bounded And Noisy Leakage

Graph Chatbot

Chat with Graph Search

Interactive Function Computation

Metastable densities for the contact process on power law random graphs

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Robust Data-Driven Dynamic Programming

Linear Function Computation in Networks: Duality and Constant Gap Results

Compressible distributions for high-dimensional statistics

Fuzzy Prophet: Parameter Exploration in Uncertain Enterprise Scenarios

A novel sampling theorem on the sphere

Fast adaptive uniformisation of the chemical master equation

Function computation over linear channels

Linear Function Computation in Networks: Duality and Constant Gap Results

Interactive Function Computation

Robust Data-Driven Dynamic Programming

Metastable densities for the contact process on power law random graphs

Fuzzy Prophet: Parameter Exploration in Uncertain Enterprise Scenarios

Approximation of Quantities of Interest in Stochastic PDEs by the Random Discrete $L^2$ Projection on Polynomial Spaces

Compressible distributions for high-dimensional statistics

A novel sampling theorem on the sphere

Function computation over linear channels

Fast adaptive uniformisation of the chemical master equation