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.
This work deals with the topic of information processing over graphs. The presentation is largely self-contained and covers results that relate to the analysis and design of multi-agent networks for the distributed solution of optimization, adaptation, and ...
Proximity information is a valuable source for social network analysis. Smartphone based sensors, like GPS, Bluetooth and ANT+, can be used to obtain proximity information between individuals within a group. However, in real-life scenarios, different peopl ...
With the advent of information technology, emails have gained wide acceptability among students as an asynchronous communication tool. According to the current pedagogy literature the overall trend of the use of email communication by university students h ...
To appreciate how neural circuits in the brain control behaviors, we must identify how the neurons comprising the circuit are connected. Neuronal connectivity is difficult to determine experimentally, whereas neuronal activity can often be readily measured ...
When can we reason about the neutrality of a network based on external observations? We prove conditions under which it is possible to (a) detect neutrality violations and (b) localize them to specific links, based on external observations. Our insight is ...
When can we reason about the neutrality of a network based on external observations? We prove conditions under which it is possible to (a) detect neutrality violations and (b) localize them to specific links, based on external observations. Our insight is ...
This paper presents a network partitioning strategy for the optimal voltage control of Active Distribution Networks (ADNs) by means of Dispersed Energy Storage Systems (DESSs). The proposed partitioning is based on the concept of voltage sensitivity coeffi ...
Part I of this paper examined the mean-square stability and convergence of the learning process of distributed strategies over graphs. The results identified conditions on the network topology, utilities, and data in order to ensure stability; the results ...
In many graph–mining problems, two networks from different domains have to be matched. In the absence of reliable node attributes, graph matching has to rely on only the link structures of the two networks, which amounts to a generalization of the classic ...
Rodents navigating in a well-known environment can rapidly learn and revisit observed reward locations, often after a single trial. While the mechanism for rapid path planning is unknown, the CA3 region in the hippocampus plays an important role, and emerg ...