Diffusion LMS algorithms with information exchange
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.
Many map-reduce frameworks as well as NoSQL systems rely on collection programming as
their interface of choice due to its rich semantics along with an easily parallelizable set of
primitives. Unfortunately, the potential of collection programming is not ...
A double-normal pair of a finite set S of points that spans R-d is a pair of points {p, q} from S such that S lies in the closed strip bounded by the hyperplanes through p and q perpendicular to pq. A double-normal pair {p, q} is strict if S \ {p,q} lies i ...
Multidimensional linear attacks are one of the most powerful variants of linear cryptanalytic techniques now. However, there is no knowledge on the key-dependent capacity and data complexity so far. Their values were assumed to be close to the average valu ...
In this work we investigate the applicability of the wing-aileron-tab model for a bridge section model being actively controlled with leading and trailing edge flaps. The structural and aerodynamic model parameters have been extracted experimentally from a ...
When we have to valorise the geological information for land planning or engineering applications, it is difficult to integrate the large complexity of the maps of the Swiss Geological Atlas at the scale of 1:25'000. The heterogeneity of the legends betwee ...
Overcomplete transforms have received considerable attention over the past years. However, they often suffer from a complexity burden. In this paper, a low complexity approach is provided, where an orthonormal basis is complemented with a set of incomplete ...
The problem of control synthesis to maximize the probability of satisfying automata specifications for systems with uncertainty is addressed. Two types of uncertainty are considered; stochasticity in the dynamical system and in the sets defining the specif ...
This work focuses on multi-robot coordination based on the Hoplites framework for solving the multi-robot task allocation (MRTA) problem. Three variations of increasing complexity for the MRTA problem, spatial task allocation based on distance, spatial tas ...
Let P be a set of n > d points in for d >= 2. It was conjectured by Zvi Schur that the maximum number of (d-1)-dimensional regular simplices of edge length diam(P), whose every vertex belongs to P, is n. We prove this statement under the condition that any ...
This study investigates and models the grinding process of single crystal sapphire. Five parameters: the wheel speed, the feed speed, the vertical feed, the ultrasonic assistance and the crystallographic direction were considered via a design of experiment ...
