Concept

Cyclic redundancy check

Related publications (42)

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.

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

Nirupam Gupta

In this article, we study the problem of Byzantine fault-tolerance in a federated optimization setting, where there is a group of agents communicating with a centralized coordinator. We allow up to

f

Byzantine-faulty agents, which may not follow a prescr ...

Piscataway2023

Low Power LDPC Decoding by Reliable Voltage Down-Scaling

Andreas Peter Burg

Low-Density Parity-Check (LDPC) decoder is among the power hungry building blocks of wireless communication systems. Voltage scaling down to Near-Threshold (NT) voltages substantially improves energy efficiency, in theory up 10x. However, tuning the voltag ...

New York2023

Spectral Measurement and Classification in the Era of Big Data

Marilyne Andersen, Forrest Simon Webler

The measurement and classification of light is essential across many scientific disciplines. Devices used to measure light range from the highly precise scanning spectroradiometers to the more practical compact multichannel filter-array type imaging sensor ...

2021

Une approche computationnelle du cadastre napoléonien de Venise

Frédéric Kaplan, Isabella Di Lenardo, Raphaël Barman, Federica Pardini

At the beginning of the 19th century, the Napoleonic administration introduced a new standardised description system to give an objective account of the form and functions of the city of Venice. The cadastre, deployed on a European scale, was offering for ...

2021

Poly-NL: Linear Complexity Non-local Layers With 3rd Order Polynomials

Grigorios Chrysos, Filippos Kokkinos

Spatial self-attention layers, in the form of Non-Local blocks, introduce long-range dependencies in Convolutional Neural Networks by computing pairwise similarities among all possible positions. Such pairwise functions underpin the effectiveness of non-lo ...

IEEE2021

Distributed Computing with Modern Shared Memory

Mihail Igor Zablotchi

In this thesis, we revisit classic problems in shared-memory distributed computing through the lenses of (1) emerging hardware technologies and (2) changing requirements. Our contributions consist, on the one hand, in providing a better understanding of th ...

EPFL2020

User Guidance for Efficient Fact Checking

Quoc Viet Hung Nguyen, Thành Tâm Nguyên

The Web constitutes a valuable source of information. In recent years, it fostered the construction of large-scale knowledge bases, such as Freebase, YAGO, and DBpedia. The open nature of the Web, with content potentially being generated by everyone, howev ...

2019

User Guidance for Efficient Fact Checking

Thanh Trung Huynh, Quoc Viet Hung Nguyen, Thành Tâm Nguyên

ASSOC COMPUTING MACHINERY2019

Design of LDPC Codes for the Unequal Power Two-User Gaussian Multiple Access Channel

Alexios Konstantinos Balatsoukas Stimming

In this letter, we describe an LDPC code design framework for the unequal power two-user Gaussian multiple access channel using EXIT charts. We show that the sumrate of the LDPC codes designed using our approach can get close to the maximal sum-rate of the ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Timely Updates over an Erasure Channel

Elie Najm, Emina Soljanin

Using an age of information (AoI) metric, we examine the transmission of coded updates through a binary erasure channel to a monitor/receiver. %Coded redundancy is employed to ensure the timely delivery of codupdate packets. We start by deriving the averag ...

2017

Byzantine Fault-Tolerance in Federated Local SGD Under 2f-Redundancy

Nirupam Gupta

In this article, we study the problem of Byzantine fault-tolerance in a federated optimization setting, where there is a group of agents communicating with a centralized coordinator. We allow up to

f

Byzantine-faulty agents, which may not follow a prescr ...

Piscataway2023