Compressed network coding vectors

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 ...

Video DeepFakes are fake media created with Deep Learning (DL) that manipulate a person’s expression or identity. Most current DeepFake detection methods analyze each frame independently, ignoring inconsistencies and unnatural movements between frames. Som ...

The remarkable ability of deep learning (DL) models to approximate high-dimensional functions from samples has sparked a revolution across numerous scientific and industrial domains that cannot be overemphasized. In sensitive applications, the good perform ...

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 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 ...

Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...

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 ...

Given a hyperelliptic hyperbolic surface S of genus g >= 2, we find bounds on the lengths of homologically independent loops on S. As a consequence, we show that for any lambda is an element of (0, 1) there exists a constant N(lambda) such that every such ...

This paper considers the problem of distributed lossy compression where the goal is to recover one or more linear combinations of the sources at the decoder, subject to distortion constraints. For certain configurations, it is known that codes with algebra ...

In this paper, we set the mathematical foundations of the Dynamical Low-Rank Approximation (DLRA) method for stochastic differential equations (SDEs). DLRA aims at approximating the solution as a linear combination of a small number of basis vectors with r ...

We report on scanningtunneling microscopy (STM) topographs ofindividual metal phthalocyanines (MPc) on a thin salt (NaCl) filmadsorbed on a gold substrate, at tunneling energies within the molecule'selectronic transport gap. Theoretical models of increasin ...

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 ...

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 ...

Iterative substructuring Domain Decomposition (DD) methods have been extensively studied, and they are usually associated with nonoverlapping decompositions. It is less known that classical overlapping DD methods can also be formulated in substructured for ...

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 ...

Dampers are devices that reduce delay jitter in the context of time-sensitive networks, by delaying packets for the amount written in packet headers. Jitter reduction is required by some real-time applications; beyond this, dampers have the potential to so ...

This paper develops high-order accurate entropy stable (ES) adaptive moving mesh finite difference schemes for the two- and three-dimensional special relativistic hydrodynamic (RHD) and magnetohydrodynamic (RMHD) equations, which is the high-order accurate ...

Long Range (LoRa) is an emerging low-power wide-area network technology offering long-range wireless connectivity to Internet of Things (IoT) devices. For energy efficiency reasons, LoRa end nodes implement a nonslotted ALOHA multiple access scheme to tran ...

Since the birth of Information Theory, researchers have defined and exploited various information measures, as well as endowed them with operational meanings. Some were born as a "solution to a problem", like Shannon's Entropy and Mutual Information. Other ...

Edge-based and face-based smoothed finite element methods (ES-FEM and FS-FEM, respectively) are modified versions of the finite element method allowing to achieve more accurate results and to reduce sensitivity to mesh distortion, at least for linear eleme ...

Compressed network coding vectors

Chat with Graph Search

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

Efficient Temporally-Aware DeepFake Detection using H.264 Motion Vectors

Towards Trustworthy Deep Learning for Image Reconstruction

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

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

A Network Calculus Analysis of Asynchronous Mechanisms in Time-Sensitive Networks

Global, Passive Detection of Connection Tampering

Short homology bases for hyperelliptic hyperbolic surfaces

Distributed Lossy Computation with Structured Codes: From Discrete to Continuous Sources

Dynamical Low-Rank Approximation for Stochastic Differential Equations

Character of Electronic States in the Transport Gap of Molecules on Surfaces

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

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

Linear and nonlinear substructured Restricted Additive Schwarz iterations and preconditioning

Optima Age Over Erasure Channels

Analysis of Dampers in Time-Sensitive Networks With Non-Ideal Clocks

High-order accurate entropy stable adaptive moving mesh finite difference schemes for special relativistic (magneto)hydrodynamics

A Maximum-Likelihood-Based Two-User Receiver for LoRa Chirp Spread-Spectrum Modulation

A Functional Perspective on Information Measures

An element-based formulation for ES-FEM and FS-FEM models for implementation in standard solid mechanics finite element codes for 2D and 3D static analysis