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

Concept

Algorithmic information theory

Related publications (27)

Information-Theoretic Caching: The Multi-User Case

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

In this paper, we consider a cache aided network in which each user is assumed to have individual caches, while upon users’ requests, an update message is sent through a common link to all users. First, we formulate a general information theoretic setting ...

Institute of Electrical and Electronics Engineers2017

Emergence of Friedmann Equation of Cosmology of a Flat Universe from the Time-Energy Uncertainty Principle

Farhad Rachidi-Haeri

Friedmann equation of cosmology is based on the field equations of general relativity. Its derivation is straight-forward once the Einstein’s field equations are given and the derivation is independent of quantum mechanics. In this paper, it is shown that ...

2017

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

Tag-based Paper Retrieval: Minimizing User Effort with Diversity Awareness

Karl Aberer, Quoc Viet Hung Nguyen, Thành Tâm Nguyên, Son Thanh Do

As the number of scientific papers getting published is likely to soar, most of modern paper management systems (e.g. ScienceWise, Mendeley, CiteULike) support tag-based retrieval. In that, each paper is associated with a set of \emph{tags}, allowing user ...

2015

Latent Social Information in Group Interactions with a Shared Workspace

Himanshu Verma

Shared artifacts, such as drawings and schemas on whiteboards, sticky-notes with ideas on walls, are often created and interacted with during meetings. These shared artifacts a) facilitate the expression of complex fleeting ideas, b) enable collaborators t ...

EPFL2015

Reducing Randomness in Matrix Models for Wireless Communication

Marc Desgroseilliers

Pushed by the proliferation of antennas and of multiuser scenarios, matrices with random entries are appearing more and more frequently in information theory. This leads to the study of matrix channels, where the capacity depends on the distribution of the ...

EPFL2015

Secret Communication Over Broadcast Erasure Channels With State-Feedback

Christina Fragouli, Suhas Diggavi, László Czap, Vinod Malathidevi Prabhakaran

We consider a 1-to-K communication scenario, where a source transmits private messages to K receivers through a broadcast erasure channel, and the receivers feedback strictly, causally, and publicly their channel states after each transmission. We explore ...

Ieee-Inst Electrical Electronics Engineers Inc2015