A Topological Treatment of Early-Deciding Set-Agreement
Related publications (135)
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.
We revisit the well-known group membership problem, and show how it can be considered a special case of a simpler problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary univer ...
This paper describes the design and semi-automated generation of a MOS current-mode logic standard cell library. A set of generic components implementing a wide range of combinational and sequential functions is proposed. The layout of the generic componen ...
In this work, we address the security of VANETs. We provide a detailed threat analysis and devise an appropriate security architecture. We also describe some major design decisions still to be made, which in some cases have more than mere technical implica ...
Light stimulation of neurons is a promising approach for investigating the molecular mechanisms at the basis of neuronal physiology and plasticity. In particular, flash photolysis of caged compounds offers the unique advantage of allowing to quickly change ...
We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...
So far, the problem of positioning in sensor and ad hoc networks has been studied in a non-adversarial setting. We show that most of the proposed positioning algorithms are highly vulnerable to attacks from compromised network nodes and malicious (outside) ...
Set agreement, where processors decisions constitute a set of outputs, is notoriously harder to analyze than consensus where the decisions are restricted to a single output. This is because the topological questions that underly set agreement are not about ...
Delineation of structures to irradiate (the tumors) as well as structures to be spared (e.g., optic nerve, brainstem, or eyes) is required for advanced radiotherapy techniques. Due to a lack of time and the number of patients to be treated these cannot alw ...
We present an overview of results developed mainly at Verimag, by the author and his colleagues, on a framework for component-based construction, characterized by the following: the behavior of atomic components is represented by transition systems; compon ...
We consider here how to assess if two classifiers, based on a set of test error results, are performing equally well. This question is often considered in the realm of sampling theory, based on classical hypothesis testing. Here we present a simple Bayesia ...