Impacts of Metering-Based Dynamic Priority Schemes
Graph Chatbot
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.
Public-key distance bounding schemes are needed to defeat relay attacks in payment systems. So far, only five such schemes exist, but fail to fully protect against malicious provers. In this paper, we solve this problem. We provide a full formalism to defi ...
In this paper, we analyze the first known provably secure Radio Frequency Identification (RFID) authentication schemes that are designed to provide forward untraceability and backward untraceability: the L-K and S-M schemes. We show how to trace tags in th ...
We present polar coding schemes for the 2-user discrete memoryless broadcast channel (DM-BC) which achieve Marton's region with both common and private messages. This is the best achievable rate region up to date, and it is tight for all classes of 2-user ...
Real-time optimization (RTO) is a class of methods that use measurements to reject the effect of uncertainty on optimal performance. This article compares six implicit RTO schemes, that is, schemes that implement optimality not through numerical optimizati ...
In nature, one observes that a K-theory of an object is defined in two steps. First a “structured” category is associated to the object. Second, a K-theory machine is applied to the latter category that produces an infinite loop space. We develop a general ...
Chemists recurrently utilize "fuzzy'' chemical concepts (e.g. atomic charges, the chemical bond, strain, aromaticity, branching, etc.), which lack unique quantitative assessments but, nonetheless, are frequently employed as tools for understanding the intr ...
We consider schemes for obtaining truthful reports on a common but hidden signal from large groups of rational, self-interested agents. One example are online feedback mechanisms, where users provide observations about the quality of a product or service s ...
In a multistage secret sharing (MSSS) scheme, the authorised subsets of participants could recover a number of secrets in different stages. A one-stage multisecret sharing (OSMSS) scheme is a special case of MSSS schemes in which all the secrets are recove ...
In this work we consider the cognitive many-to-one interference network. We first extend existing coding schemes from the two-user case to this network scenario. Then we present a novel coding scheme using compute-and-forward and show it can enlarge the ac ...
We prove the existence of Pareto optimal allocations within sets of acceptable allocations when decision makers have probabilistic sophisticated variational preferences defined on random endowments in L1. ...
