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.
This paper addresses the problem of designing an efficient implementation of a basic atomic read-write data structure over an asynchronous message-passing system. In particular, we consider time-efficient implementations of this abstraction in the case of ...
This paper establishes the first theorem relating resilience, round complexity and authentication in distributed computing. We give an exact measure of the time complexity of consensus algorithms that tolerate Byzantine failures and arbitrary long periods ...
Bayesian regression, a nonparametric identification technique with several appealing features, can be applied to the identification of NARX (nonlinear ARX) models. However, its computational complexity scales as O(N3) where N is the data set size. In ...
Linear cryptanalysis remains the most powerful attack against DES at this time. Given 243 known plaintext-ciphertext pairs, Matsui expected a complexity of less than 243 DES evaluations in 85% of the cases for recovering the key. In this paper, w ...
In this work we propose several algorithms to solve the reconfiguration problem for linear and hybrid systems. In particular, we consider the decision about the usage of redundant hardware in order to compensate for faults. While this problem can be transl ...
This paper investigates the time-complexity of the non-blocking atomic commit (NBAC) problem in a synchronous distributed model where t out of n processes may fail by crashing. We exhibit for t > 3 an inherent trade-off between the fast abort property of N ...
Recently, statistically optimal detection methods for communication schemes based on chaos have been developed. The decision criterion is based on the well-known maximum likelihood criterion. Unfortunately, the calculation of the likelihoods is of exponent ...
Bayesian regression, a nonparametric identification technique with several appealing features, can be applied to the identification of NARX (nonlinear ARX) models. However, its computational complexity scales as O(N3) where N is the data set size. In ...
In speaker verification, two independent stochastic models, i.e. a client model and a non-client (world) model, are generally used to verify the claimed identity using a likelihood ratio score. This paper investigates a variant of this approach based on a ...
In this work we propose several algorithms to solve the reconfiguration problem for linear and hybrid systems. In particular, we consider the decision about the usage of redundant hardware in order to compensate for faults. While this problem can be transl ...
