Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Byzantine agreement enables n processes to agree on a common L-bit value, despite up to t > 0 arbitrary failures. A long line of work has been dedicated to improving the bit complexity of Byzantine agreement in synchrony. This has culminated in COOL, an er ...

In this paper, we present EdgeFace - a lightweight and efficient face recognition network inspired by the hybrid architecture of EdgeNeXt. By effectively combining the strengths of both CNN and Transformer models, and a low rank linear layer, EdgeFace achi ...

We survey lower-bound results in complexity theory that have been obtained via newfound interconnections between propositional proof complexity, boolean circuit complexity, and query/communication complexity. We advocate for the theory of total search prob ...

We consider the problem of making a multi-agent system (MAS) resilient to Byzantine failures through replication. We consider a very general model of MAS, where randomness can be involved in the behavior of each agent. We propose the first universal scheme ...

Quantum electronic circuits where the logic information is processed and stored in single flux quanta promise efficient computation in a performance/power metric, and thus are of utmost interest as possible replacement or enhancement of CMOS. Several elect ...

Loading classical data into quantum registers is one of the most important primitives of quantum computing. While the complexity of preparing a generic quantum state is exponential in the number of qubits, in many practical tasks the state to prepare has a ...

Modeling urban traffic on the level of network is a wide research area oriented to the development of ITS. In this thesis properties of models based on MFD (Macroscopic Fundamental Diagram) are studied. The idea behind MFD is to say that the state of the t ...

Clocking power, including both clock distribution and registers, has long been one of the primary factors in the total power consumption of many digital systems. One straightforward approach to reduce this power consumption is to apply dual-edge-triggered ...

The articles in this special section focus on long term human motion prediction. This represents a key ability for advanced autonomous systems, especially if they operate in densely crowded and highly dynamic environments. In those settings understanding a ...

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

Reliable broadcast is a communication primitive guaranteeing, intuitively, that all processes in a distributed system deliver the same set of messages. The reason why this primitive is appealing is twofold: (i) we can implement it deterministically in a co ...

Consensus protocols for asynchronous networks are usually complex and inefficient, leading practical systems to rely on synchronous protocols. The invention proposes an approach to simplify asynchronous consensus by building it atop a novel threshold logic ...

We address delay faults: faults that cause a software component to take more time for completing an action than a given deadline. Such faults are particularly of interest in real- time mission-critical control applications that use general-purpose computin ...

We considerm-colorings of the edges of a complete graph, where each color class is defined semi-algebraically with bounded complexity. The casem= 2 was first studied by Alon et al., who applied this framework to obtain surprisingly strong Ramsey-type resul ...

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

Current very low bit rate speech coders are, due to complexity limitations, designed to work off-line. This paper investigates incremental speech coding that operates real-time and incrementally (i.e., encoded speech depends only on already-uttered speech ...

Many images uploaded to social networks are related to travel, since people consider traveling to be an important event in their life. However, a signiﬁcant amount of travel images on the Internet lack proper geographical annotations or tags. In many cases ...

Since the Industrial Revolution, urban spaces have undergone a profound reorganisation in parallel with a transformation of society and lifestyles. Urban sprawl has become widespread in Switzerland, as in countless countries, due to continuous innovations ...

Heuristic tools from statistical physics have been used in the past to locate the phase transitions and compute the optimal learning and generalization errors in the teacher-student scenario in multi-layer neural networks. In this paper, we provide a rigor ...

Set agreement is a fundamental problem in distributed computing in which processes collectively choose a small subset of values from a larger set of proposals. The impossibility of fault-tolerant set agreement in asynchronous networks is one of the seminal ...

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement

Chattez avec Graph Search

Efficient Signature-Free Validated Agreement

EdgeFace: Efficient Face Recognition Model for Edge Devices

Proofs, Circuits, and Communication

Byzantine-Resilient Multi-Agent System

Design and Optimization of Quantum Electronic Circuits

Efficient deterministic preparation of quantum states using decision diagrams

The influence of trip length distribution on urban traffic in network-level models

Automated Integration of Dual-Edge Clocking for Low-Power Operation in Nanometer Nodes

Guest Editorial: Introduction to the Special Issue on Long-Term Human Motion Prediction

On some algebraic and extremal problems in discrete geometry

Dynamic Byzantine Reliable Broadcast

Asynchronous distributed coordination and consensus with threshold logical clocks

Axo: Tolerating Delay Faults in Real-Time Systems

The Schur-Erdos problem for sesmi-algebraic colorings

Distributed Computing with Modern Shared Memory

Incremental Syllable-Context Phonetic Vocoding

Comparative Study of Trust Modeling For Automatic Landmark Tagging

Quartiers résidentiels périurbains en transition : Comparaison multicritère de scénarios prospectifs à l'horizon 2050

The committee machine: computational to statistical gaps in learning a two-layers neural network

Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement