Concept

Concentration inequality

Related publications (94)

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.

On the Capacity of Large Gaussian Relay Networks

Martin Vetterli, Michael Christoph Gastpar

The capacity of a particular large Gaussian relay network is determined in the limit as the number of relays tends to infinity. Upper bounds are derived from cut-set arguments, and lower bounds follow from an argument involving uncoded transmission. It is ...

2005

Design of Probabilistic Observers for Mass-Balance-Based Bioprocess Models

Benoît Chachuat, Olivier Bernard

In this paper, the design of probabilistic observers for mass-balance based bioprocess models is investigated. It is assumed that the probability density of every uncertain parameter, input and/or initial state is known a priori. Then, the probability dens ...

2004

Design and Practical Use of Probabilistic Observers for Mass-Balance-Based Bioprocess Models

Benoît Chachuat, Olivier Bernard

In this paper, the design of probabilistic observers for mass-balance based bio- process models is investigated. It is assumed that the probability density function of every uncertain parameter, input and/or initial state is known a priori. Then, the proba ...

2004

Analysis of a subdomain-based error estimator for finite element approximations of elliptic problems

Fabio Nobile

In this article we analyze a subdomain residual error estimator for finite element approximations of elliptic problems. It is obtained by solving local problems on patches of elements in weighted spaces and provides an upper bound on the energy norm of the ...

Wiley-Blackwell2004

Bounds on the k-neighborhood for locally uniformly sampled surfaces

Mark Pauly, Jean Jouve

Given a locally uniform sample set P of a smooth surface S. We derive upper and lower bounds on the number k of nearest neighbors of a sample point p that have to be chosen from P such that this neighborhood contains all restricted Delaunay neighbors of p. ...

Eurographics Association2004

Connectivity vs Capacity in Dense Ad Hoc Networks

Patrick Thiran, Olivier Dousse

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuat ...

2004

Lower Bounds on Generic Broadcast Algorithms

André Schiper, Fernando Pedone

This paper establishes tight lower bounds on the time complexity of algorithms solving the generic broadcast problem. Generic broadcast assumes a symmetric, non-reflexive conflict relation on the set of messages, and requires ordered delivery only for conf ...

2004

Bits of Internet traffic control

Milan Vojnovic

In this work, we consider four problems in the context of Internet traffic control. The first problem is to understand when and why a sender that implements an equation-based rate control would be TCP-friendly, or not—a sender is said to be TCP-friendly if ...

EPFL2003

On the capacity of large Gaussian relay networks

Martin Vetterli, Michael Christoph Gastpar

We determine the capacity of a particular large Gaussian relay network in the limit as the number of relays tends to infinity. The upper bounds follow from a cut-set argument, and the lower bound follows from an argument involving uncoded transmission. We ...

2002

Rate Distortion Behavior of Sparse Sources

Martin Vetterli

This paper studies the rate distortion behavior of sparse memoryless sources that serve as models of sparse signal representations. For the Hamming distortion criterion,

R(D)

is shown to be essentially linear. For the mean squared error measure, two mode ...

2001

Rate Distortion Behavior of Sparse Sources

Martin Vetterli

This paper studies the rate distortion behavior of sparse memoryless sources that serve as models of sparse signal representations. For the Hamming distortion criterion,

R(D)

is shown to be essentially linear. For the mean squared error measure, two mode ...

2001