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

Concept

Join and meet

Publications associées (6)

Shannon Bounds on Lossy Gray-Wyner Networks

Michael Christoph Gastpar, Erixhen Sula

The Gray-Wyner network subject to a fidelity criterion is studied. Upper and lower bounds for the trade-offs between the private sum-rate and the common rate are obtained for arbitrary sources subject to mean-squared error distortion. The bounds meet exact ...

2022

The concept of axial weak twins

Cyril Cayron

It is generally assumed that the parent-twin interface is a fully invariant plane. The calculations of the rational interfaces of the type I twins and irrational interfaces of the type II twins are based on this hypothesis. Recently, some asymmetric facets ...

PERGAMON-ELSEVIER SCIENCE LTD2022

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Erixhen Sula

Network information theory studies the communication of information in a network and considers its fundamental limits. Motivating from the extensive presence of the networks in the daily life, the thesis studies the fundamental limits of particular network ...

EPFL2021

A lower bound on opaque sets

János Pach

It is proved that the total length of any set of countably many rectifiable curves whose union meets all straight lines that intersect the unit square U is at least 2.00002. This is the first improvement on the lower bound of 2 known since 1964. A similar ...

ELSEVIER SCIENCE BV2019

On Source Transmission over Deterministic Relay Networks

Suhas Diggavi, Soheil Mohajerzefreh

Lossless transmission of a set of correlated sources over a deterministic relay network is considered for two traffic requirements. In distributed multicast, the set of sources are to be delivered to a set of destinations. The source exchange requires all ...

2010

Expressiveness And Closure Properties For Quantitative Languages

Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In the case of infinite words, the value of a run is naturally computed as the ma ...

2010

Publications associées (6)