Consensus and collision detectors in radio networks

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.

BackgroundThe increasing use of complex and high dose-rate treatments in radiation therapy necessitates advanced detectors to provide accurate dosimetry. Rather than relying on pre-treatment quality assurance (QA) measurements alone, many countries are now ...

Gruber et al. (2022) offered a framework how to explain "Physical time within human time", solving the 'two times problem: Here, I am asking whether such a problem exists at all. To question the question, I will appeal to neurobiological, evolutionary, and ...

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

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

In a non-synchronous system with n processes, no t(0)-resilient (deterministic or probabilistic) Byzantine consensus protocol can prevent a disagreement among correct processes if the number of faulty processes is > n - 2t(0). Therefore, the community defi ...

The Byzantine consensus problem involves.. processes, out of which t < n could be faulty and behave arbitrarily. Three properties characterize consensus: (1) termination, requiring correct (nonfaulty) processes to eventually reach a decision, (2) agreement ...

In this thesis, we give new approximation algorithms for some NP-hard problems arising in resource allocation and network design. As a resource allocation problem, we study the Santa Claus problem (also known as the MaxMin Fair Allocation problem) in which ...

It is known that the agreement property of the Byzantine consensus problem among n processes can be violated in a non-synchronous system if the number of faulty processes exceeds t0 = ┌n/3┐ − 1 [10], [19]. In this paper, we investigate the accountable Byza ...

Internet blackouts are challenging environments for anonymity and censorship resistance. Existing popular anonymity networks (e.g., Freenet, I2P, Tor) rely on Internet connectivity to function, making them impracticable during such blackouts. In such a set ...

Submodular functions are a widely studied topic in theoretical computer science. They have found several applications both theoretical and practical in the fields of economics, combinatorial optimization and machine learning. More recently, there have also ...

Today, automatic control is integrated into a wide spectrum of real-world systems such as electrical grids and transportation networks. Many of these systems comprise numerous interconnected agents, perform safety-critical operations, or generate large amo ...

n-linear impedance characteristics of VO2 offer solutions to highly sensitive radio-frequency (RF), millimeterwave (mm-wave), and terahertz (THz) detectors. We demonstrate high-speed broadband sensibility of miniaturized VO2 switches by utilizing the nonli ...

There is an increasing interest in a fast-growing machine learning technique called Federated Learning (FL), in which the model training is distributed over mobile user equipment (UEs), exploiting UEs' local computation and training data. Despite its advan ...

Classical synchronous consensus algorithms are leaderless: processes exchange their proposals, retain the maximum value and decide when they see the same choice across a couple of rounds. Indulgent consensus algorithms are more robust in that they only req ...

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

We consider a learning system based on the conventional multiplicative weight ( MW) rule that combines experts' advice to predict a sequence of true outcomes. It is assumed that one of the experts is malicious and aims to impose the maximum loss on the sys ...

Modern silicon-based detectors for high-energy physics operate in an experimental environment with sub-zero temperatures. At those temperatures, even low traces of humidity will produce vapor condensation with damages to the detectors. Monitoring relative ...

Given a source of iid samples of edges of an input graph G with n vertices and m edges, how many samples does one need to compute a constant factor approximation to the maximum matching size in G? Moreover, is it possible to obtain such an estimate in a sm ...

An integer program (IP) is a problem of the form

\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \in \Z^n\}

, where

A \in \Z^{m \times n}

b \in \Z^m

l,u \in \Z^n

, and

f: \Z^n \rightarrow \Z

is a separable convex objective function. The problem o ...

This paper is a study on the use of Machine Learning and Deep Learning to determine the similarity between different musics. The first part introduces the framework used and some concepts of Deep Learning that will be used in the algorithms. The second par ...

Consensus and collision detectors in radio networks

Chat with Graph Search

Characterization of a flexible a-Si:H detector for in vivo dosimetry in therapeutic x-ray beams

The Two Times Problem: Where Is the Problem?

Planetary-Scale Byzantine Fault Tolerance

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

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

On the Validity of Consensus

Approximation Algorithms for Allocation and Network Design

As easy as ABC: Optimal (A)ccountable (B)yzantine (C)onsensus is easy!

Moby: A Blackout-Resistant Anonymity Network for Mobile Devices

Streaming and Matching Problems with Submodular Functions

Data-driven and Safe Networked Control with Applications to Microgrids

Subthreshold VO2 vertical switches for large-bandwidth millimeter-wave and sub-terahertz detection

Federated Learning Over Wireless Networks: Convergence Analysis and Resource Allocation

Leaderless Consensus

Feedback and Common Information: Bounds and Capacity for Gaussian Networks

Optimal Adversarial Policies in the Multiplicative Learning System With a Malicious Expert

Humidity Sensors for High Energy Physics Applications: A Review

Space Efficient Approximation to Maximum Matching Size from Uniform Edge Samples

New Results in Integer and Lattice Programming

Deep Learning for Music: Similarity Search and Beyond