Concept

Bounded set

Related publications (84)

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

An Adaptive Sparse Grid Algorithm for Elliptic PDEs with Lognormal Diffusion Coefficient

Fabio Nobile, Lorenzo Tamellini, Francesco Tesei

In this work we build on the classical adaptive sparse grid algorithm (T. Gerstner and M. Griebel, Dimension-adaptive tensor-product quadrature), obtaining an enhanced version capable of using non-nested collocation points, and supporting quadrature and in ...

Springer2016

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

The number of double-normals in space

Andrei Kupavskii

Given a set V of points in , two points p, q from V form a double-normal pair, if the set V lies between two parallel hyperplanes that pass through p and q, respectively, and that are orthogonal to the segment pq. In this paper we study the maximum number ...

Springer2016

A New Converse Bound for Coded Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is char ...

2016

Existence and Uniqueness Theorems for the Two-Dimensional Ericksen-Leslie System

Tudor Ratiu

In this paper we study the two dimensional Ericksen-Leslie equations for the nematodynamics of liquid crystals if the moment of inertia of the molecules does not vanish. We prove short time existence and uniqueness of strong solutions for the initial value ...

Springer Verlag2016

Renormalized solutions to the continuity equation with an integrable damping term

Maria Colombo

We consider the continuity equation with a nonsmooth vector field and a damping term. In their fundamental paper, DiPerna and Lions (Invent Math 98:511-547, 1989) proved that, when the damping term is bounded in space and time, the equation is well posed i ...

2015

Global Ill-Posedness of the Isentropic System of Gas Dynamics

Elisabetta Chiodaroli, Camillo De Lellis

We consider the isentropic compressible Euler system in 2 space dimensions with pressure law p () = (2) and we show the existence of classical Riemann data, i.e. pure jump discontinuities across a line, for which there are infinitely many admissible bounde ...

Wiley-Blackwell2015

The Chaining Lemma and Its Application

Sebastian Faust

We present a new information-theoretic result which we call the Chaining Lemma. It considers a so-called "chain" of random variables, defined by a source distribution X-(0) with high min-entropy and a number (say, t in total) of arbitrary functions (T-1,.. ...

Springer-Verlag Berlin2015

MATHICSE Technical Report : An adaptive sparse grid algorithm for elliptic PDEs with lognormal diffusion coefficient

Fabio Nobile, Lorenzo Tamellini, Francesco Tesei

MATHICSE2015

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.