Supplemental Information for the New Definition of the EF PHB
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.
This paper describes improved methods for XTR key representation and parameter generation (Lenstra et al., 2000). If the field characteristic is properly chosen, the size of the XTR public key for signature applications can be reduced by a factor of three ...
We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of m ...
In this paper we focus on observability for hybrid systems in the mixed-logic dynamical form. We show that the maximal set of observable states, that is usually non convex and disconnected, can be represented as the union of finitely many polytopic regions ...
In this paper we address the problem of defining a measure of diversity for a population of individuals whose genome can be subjected to major reorganizations during the evolutionary process. To this end, we introduce a measure of diversity for populations ...
In this thesis we address the problem of safe substitutability in mobile component-oriented formalisms. We try to give a solution for different definitions of "safe" through a new notion of subtyping based on flexibility and observation. The aim is to have ...
We measure and analyze the single-hop packet delay through operational routers in the Sprint Internet protocol (IP) backbone network. After presenting our delay measurements through a single router for OC-3 and OC-12 link speeds, we propose a methodology t ...
We present a novel scheduling algorithm, Duplicate Scheduling with Deadlines (DSD). This algorithm implements the ABE service which allows interactive, adaptive applications, that mark their packets green, to receive a low bounded delay at the expense of m ...
This paper describes several speedups for computation in the order p + 1 subgroup of F*(p2) and the order p2 - p + 1 subgroup of F*(p6). These results are in a way complementary to LUC and XTR, where computations in these g ...
During the Limitation of Oxidant Prodn. (LOOP) campaign, different instruments were deployed, providing a complete data set. This will be used to evaluate the model and its ability to reproduce pollution events. Then, the complete data set will be used for ...
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algo ...