Robustness and convergence of adaptive schemes in blind equalization
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.
With technology advances, the number of cores integrated on a chip and their speed of operation is increasing. This, in turn is leading to a significant increase in chip temperature. Temperature gradi- ents and hot-spots not only affect the performance of ...
In this paper we present the design and evaluate the performance of an autonomic workflow execution engine. Although there exist many distributed workflow engines, in practice, it remains a difficult problem to deploy such systems in an optimal configurati ...
Liberalization is generally credited with efficiency gains and growing economic performance. However, in the network industries such a vision is generally too simplistic, as economic performance is only one of the performance criteria – there is also techn ...
Iterative Learning Control (ILC) is a technique used to improve the tracking performance of systems carrying out repetitive tasks, which are affected by deterministic disturbances. The achievable performance is greatly degraded, however, when non-repeating ...
Comparative Performance Analysis of Ordering Strategies in Atomic Broadcast Algorithms Xavier Defago, Andre Schiper, Peter Urban In this paper, we present the results of a comparative analysis of Atomic Broadcast algorithms. The analysis was done by using ...
A fundamental statistical problem is to indicate which of two hypotheses is better supported by the data. Statistics designed for this purpose are called weight of evidence. In this paper we study the problem of robust weights of evidence, optimal in their ...
Deterministic Network Calculus provides an elegant way to compute performance bounds, e.g. bounds on backlog, delay-jitter, loss ratio, and like. Such bounds are deterministic worst-case bounds. In some cases it is practically sensible that individual flow ...
This paper studies the application of robust state-space estimation with uncertain models to tracking problems in human-machine interfaces. The need for robust methods arises from the desire to control the influence of uncertain environmental conditions on ...
Resource contention is widely recognized as having a major impact on the performance of distributed algorithms. Nevertheless, the metrics that are commonly used to predict their performance take little or no account of contention. In this paper, we define ...