Incremental Adaptive Strategies Over Distributed Networks
Related publications (34)
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.
It has been known for decades that the metabolic rate of animals scales with body mass with an exponent that is almost always 2/3, and often very close to 3/4. The 3/4 exponent emerges naturally from two models of resource distribution networks, radia ...
We consider two capacity problems in P2P networks. In the first one, the nodes have an infinite amount of data to send and the goal is to optimally allocate their uplink bandwidths such that the demands of every peer in terms of receiving data rate are met ...
The efficiency of distributed sensor networks depends on an optimal trade-off between the usage of resources and data quality. This workshop paper addresses the problem of optimizing this trade-off in self-configured distributed sensor networks. In our cas ...
We study the problem of distributed detection, where a set of nodes is required to decide between two hypotheses based on available measurements. We seek fully distributed and adaptive implementations, where all nodes make individual real-time decisions by ...
In this paper, the steady-state performance of the distributed least mean-squares (dLMS) algorithm within an incremental network is evaluated without the restriction of Gaussian distributed inputs. Computer simulations are presented to verify the derived p ...
We study the problem of distributed detection, where a set of nodes are required to decide between two hypotheses based on their measurements. We seek fully distributed implementations, where all nodes make individual decisions by communicating with their ...
It is notoriously difficult to develop reliable, high-performance distributed systems that run over asynchronous networks. Even if a distributed system is based on a well-understood distributed algorithm, its implementation can contain errors arising from ...
We consider the problem of distributed estimation, where a set of nodes is required to collectively estimate some parameter of interest from noisy measurements. The problem is useful in several contexts including wireless and sensor networks, where scalabi ...
The determination of the sensible heat flux over urban terrain is challenging due to irregular surface geometry and surface types. To address this, in 2006–07, a major field campaign (LUCE) took place at the École Polytechnique Fédérale de Lausanne campus, ...
Most distributed systems are large-scale and dynamic. Communication has thus become a critical issue and the shared memory, which is a reliable paradigm of communication, allow distributed nodes to exchange information through read and write operations. In ...