Subspace properties of network coding and their applications

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.

Information theory has allowed us to determine the fundamental limit of various communication and algorithmic problems, e.g., the channel coding problem, the compression problem, and the hypothesis testing problem. In this work, we revisit the assumptions ...

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...

Water distribution systems (WDSs) are complex networks with numerous interconnected junctions and pipes. The robustness and reliability of these systems are critically dependent on their network structure, necessitating detailed analysis for proactive leak ...

Proprioception tells the brain the state of the body based on distributed sensors in the body. However, the principles that govern proprioceptive processing from those distributed sensors are poorly understood. Here, we employ a task-driven neural network ...

In-network devices around the world monitor and tamper with connections for many reasons, including intrusion prevention, combating spam or phishing, and country-level censorship. Connection tampering seeks to block access to specific domain names or keywo ...

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

We study an energy market composed of producers who compete to supply energy to different markets and want to maximize their profits. The energy market is modeled by a graph representing a constrained power network where nodes represent the markets and lin ...

We generalize the class vectors found in neural networks to linear subspaces (i.e., points in the Grassmann manifold) and show that the Grassmann Class Representation (GCR) enables simultaneous improvement in accuracy and feature transferability. In GCR, e ...

Artificial Neural Networks (ANN) are habitually trained via the back-propagation (BP) algorithm. This approach has been extremely successful: Current models like GPT-3 have O(10 11 ) parameters, are trained on O(10 11 ) words and produce awe-inspiring resu ...

Headwater streams often experience intermittent flow. Consequently, the flowing drainage network expands and contracts and the flowing drainage density (DD) varies over time. Monitoring the DD dynamics is essential to understand the processes controlling i ...

We are used to defining network neutrality as absence of traffic differentiation, like policing or shaping. These mechanisms, however, are often not what determines end-users’ quality of experience (QoE). Most content today is accessed through edge caches, ...

Incidents where water networks are contaminated with microorganisms or pollutants can result in a large number of infected or ill persons, and it is therefore important to quickly detect, localize and estimate the spread and source of the contamination. In ...

Reduced-order models are indispensable for multi-query or real-time problems. However, there are still many challenges to constructing efficient ROMs for time-dependent parametrized problems. Using a linear reduced space is inefficient for time-dependent n ...

In control system networks, reconfiguration of the controller when agents are leaving or joining the network is still an open challenge, in particular when operation constraints that depend on each agent's behavior must be met. Drawing our motivation from ...

Time-sensitive networks, as in the context of IEEE Time-Sensitive Networking (TSN) and IETF Deterministic Networking (DetNet), offer deterministic services with guaranteed bounded latency in order to support safety-critical applications. In this thesis, we ...

While systems designers are increasingly turning to hardware accelerators for performance gains, realizing these gains is painstaking and error-prone. It can take several person-months to determine if a given accelerator is a good fit for a given piece of ...

This thesis focuses on two selected learning problems: 1) statistical inference on graphs models, and, 2) gradient descent on neural networks, with the common objective of defining and analysing the measures that characterize the fundamental limits. In th ...

Synaptic plasticity underlies our ability to learn and adapt to the constantly changing environment. The phenomenon of synapses changing their efficacy in an activity-dependent manner is often studied in small groups of neurons in vitro or indirectly throu ...

Signalized intersections are a fundamental part of urban networks. Their understanding is crucial to identify congestion patterns, queues, delays, and safety issues in local and network level. In this work, we analyze multimodal vehicle trajectories and pr ...

Previous works on age of information and erasure channels have dealt with specific models and computed the average age or average peak age for certain settings. In this paper, given a source that produces a letter every T-s seconds and an erasure channel t ...

Subspace properties of network coding and their applications

Chat with Graph Search

On Speed and Advantage : Results in Information Velocity and Monitoring Problems

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Towards an Understanding of Hydraulic Sensitivity: Graph Theory Contributions to Water Distribution Analysis

Task-driven neural network models predict neural dynamics of proprioception: Neural network model weights

Global, Passive Detection of Connection Tampering

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Equilibria in Network Constrained Energy Markets

Get the Best of Both Worlds: Improving Accuracy and Transferability by Grassmann Class Representation

Artificial Neural Network Training on an Optical Processor via Direct Feedback Alignment

Short-term dynamics of drainage density based on a combination of channel flow state surveys and water level measurements

Caching and Neutrality

Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information

Non-intrusive data-driven reduced-order modeling for time-dependent parametrized problems

Model Predictive Control for Multi-Agent Systems under Limited Communication and Time-Varying Network Topology

Worst-Case Delay Analysis of Time-Sensitive Networks with Network Calculus

The Case for Performance Interfaces for Hardware Accelerators

Fundamental Limits in Statistical Learning Problems: Block Models and Neural Networks

Principles of Network Plasticity in Neocortical Microcircuits

An automatized signal timing detection at signalized intersections with detailed vehicle trajectory data

Optima Age Over Erasure Channels