Publications related to Pseudorandomness

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.

A continuation multilevel Monte Carlo algorithm

Fabio Nobile, Erik Gustaf Bogislaw Von Schwerin

We propose a novel Continuation Multi Level Monte Carlo (CMLMC) algorithm for weak approximation of stochastic models. The CMLMC algorithm solves the given approximation problem for a sequence of decreasing tolerances, ending when the required error tolera ...

2015

Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Fabio Nobile, Daniel Kressner, Christine Tobler, Rajesh Kumar

Gaussian random fields are widely used as building blocks for modeling stochastic processes. This paper is concerned with the efficient representation of d-point correlations for such fields, which in turn enables the representation of more general stochas ...

2015

Random walks generated by equilibrium contact processes

Thomas Mountford

We consider dynamic random walks where the nearest neighbour jump rates are determined by an underlying supercritical contact process in equilibrium. This has previously been studied by den Hollander and dos Santos (arXiv: 1209.1511). We show the CLT for s ...

Univ Washington, Dept Mathematics2015

Quantization Design for Unconstrained Distributed Optimization

Colin Neil Jones, Ye Pu, Melanie Nicole Zeilinger

We consider an unconstrained distributed optimization problem and assume that the bit rate of the communication in the network is limited. We propose a distributed optimization algorithm with an iteratively refining quantization design, which bounds the qu ...

2015

DASS: Distributed Adaptive Sparse Sensing

Martin Vetterli, Juri Ranieri, Zichong Chen, Runwei Zhang

Wireless sensor networks are often designed to perform two tasks: sensing a physical field and transmitting the data to end-users. A crucial aspect of the design of a WSN is the minimization of the overall energy consumption. Previous researchers aim at op ...

Institute of Electrical and Electronics Engineers2015

Practical and Provably Secure Distance-Bounding

Serge Vaudenay, Aikaterini Mitrokotsa

From contactless payments to remote car unlocking, many applications are vulnerable to relay attacks. Distance bounding protocols are the main practical countermeasure against these attacks. In this paper, we present a formal analysis of SKI, which recentl ...

IOS Press2015

Lifetimes of long-lived states in inhomogeneous magnetic fields

Geoffrey Bodenhausen, Srinivas Chinthalapalli, Maninder Singh

Long-lived states (LLS), also known as singlet states, have been widely studied in the last decade. So far, LLS have only been observed in homogeneous magnetic fields, which preclude applications to many biological samples that are inherently inhomogeneous ...

Elsevier2015

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Ali H. Sayed

In Part I of this paper, also in this issue, we introduced a fairly general model for asynchronous events over adaptive networks including random topologies, random link failures, random data arrival times, and agents turning on and off randomly. We perfor ...

Institute of Electrical and Electronics Engineers2015

Pseudorandomness

Graph Chatbot

Chat with Graph Search

A continuation multilevel Monte Carlo algorithm

Leader-Based versus Soft Control of Multi-Agent Swarms

Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Random walks generated by equilibrium contact processes

Quantization Design for Unconstrained Distributed Optimization

Cast aluminium microwires

DASS: Distributed Adaptive Sparse Sensing

Practical and Provably Secure Distance-Bounding

Lifetimes of long-lived states in inhomogeneous magnetic fields

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Random walks generated by equilibrium contact processes

A continuation multilevel Monte Carlo algorithm

Low-rank tensor approximation for high-order correlation functions of Gaussian random fields

Quantization Design for Unconstrained Distributed Optimization

Cast aluminium microwires

DASS: Distributed Adaptive Sparse Sensing

Practical and Provably Secure Distance-Bounding

Lifetimes of long-lived states in inhomogeneous magnetic fields

Asynchronous Adaptation and Learning Over Networks—Part II: Performance Analysis

Leader-Based versus Soft Control of Multi-Agent Swarms