Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Borne supérieure et borne inférieure

Publications associées (30)

On the energy benefit of compute-and-forward for multiple unicasts

Michael Christoph Gastpar, Jasper Goseling

Compute-and-forward (CF) is a technique which exploits broadcast and superposition in wireless networks. In this paper, the CF energy benefit is studied for networks with unicast sessions and modeled by connected graphs. This benefit is defined as the rati ...

Ieee2016

Lyapunov Exponents for Branching Processes in a Random Environment: The Effect of Information

Sophie Myriam Hautphenne

We consider multitype branching processes evolving in a Markovian random environment. To determine whether or not the branching process becomes extinct almost surely is akin to computing the maximal Lyapunov exponent of a sequence of random matrices, which ...

Springer Verlag2016

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

Accelerated ADMM based on Accelerated Douglas-Rachford Splitting

Colin Neil Jones, Ivan Pejcic

Alternating direction method of multipliers (ADMM) is a form of augmented Lagrangian optimisation algorithm that found its place in many new applications in recent years. This paper explores a possibility for an upgrade of the ADMM by extrapolation-based a ...

Ieee2016

Lower bounds for Pythagoras numbers of function fields

David Maximilian Grimm

We show that the transcendence degree of a real function field over an arbitrary real base field is a strict lower bound for its Pythagoras number and a weak lower bound for all its higher Pythagoras numbers. ...

European Mathematical Soc2015

Bounds for Pach's Selection Theorem and for the Minimum Solid Angle in a Simplex

Jan Kyncl

We estimate the selection constant in the following geometric selection theorem by Pach: For every positive integer d, there is a constant such that whenever are n-element subsets of , we can find a point and subsets for every , each of size at least , suc ...

Springer2015

Moments And Growth Indices For The Nonlinear Stochastic Heat Equation With Rough Initial Conditions

Robert Dalang, Le Chen

We study the nonlinear stochastic heat equation in the spatial domain R, driven by space-time white noise. A central special case is the parabolic Anderson model. The initial condition is taken to be a measure on R, such as the Dirac delta function, but th ...

Inst Mathematical Statistics2015

Second-order sensitivity of parallel shear flows and optimal spanwise-periodic flow modifications

François Gallaire, Edouard Boujo, Andrea Fani

The question of optimal spanwise-periodic modification for the stabilisation of spanwise-invariant flows is addressed. A second-order sensitivity analysis is conducted for the linear temporal stability of parallel flows U-0 subject to small-amplitude spanw ...

Cambridge University Press2015

Secure transmission using an untrusted relay with scaled compute-and-forward

Michael Christoph Gastpar, Jasper Goseling

A two-hop channel is considered, in which the source wants to send information to the destination while keeping the information confidential from the relay. A novel lattice chain and compute-and-forward based scheme is proposed in which the destination pro ...

IEEE2015

On the DCJ Median Problem

Bernard Moret, Mingfu Shao

As many whole genomes are sequenced, comparative genomics is moving from pairwise comparisons to multiway comparisons framed within a phylogenetic tree. A central problem in this process is the inference of data for internal nodes of the tree from data giv ...

Springer-Verlag Berlin2014