Networks of Mixed Canonic-Dissipative Systems and Dynamic Hebbian Learning
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.
GLOBALDIV - A global view of livestock biodiversity and conservation - is a three- year project funded by the European Commission in the framework of the AGRI GEN RES initiative. It is formed by a core group of partners who participated in past EU or conti ...
Since the seminal work of Watts in the late 90s, graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures. Most studies have focused on functional connectivity defined between whole brain regions, using imag ...
In a drawing of a graph, two edges form an odd pair if they cross each other an odd number of times. A pair of edges is independent if they share no endpoint. For a graph G, let ocr(G) be the smallest number of odd pairs in a drawing of G and let iocr(G) b ...
Since the seminal work of Watts in the late 90s [1], graph-theoretic analyses have been performed on many complex dynamic networks, including brain structures [2]. Most studies have focused on functional connectivity defined between whole brain regions, us ...
This article looks at the malandro, the bandit of Venezuela’s poor neighborhoods, as a paradoxical and hybrid figure of the urban Caribbean, a virtuoso actor of the cultures of emergency and Asphalt. Threatened by global uncertainty, postcolonial Creole ci ...
We are interested in coloring the vertices of a mixed graph, i.e., a graph containing edges and arcs. We consider two different coloring problems: in the first one we want adjacent vertices to have different colors and the tail of an arc to get a color str ...
We study the dynamics of a network consisting of N diffusively coupled, stable- limit-cycle oscillators on which individual frequencies are parametrized by wk,k=1,...,N. We introduce a learning rule which influences the wk by driving the system t ...
A magnet is a pair u, v of adjacent vertices such that the proper neighbours of u are completely linked to the proper neighbours of v. It has been shown that one can reduce the graph by removing the two vertices u, v of a magnet and introducing a new verte ...
The aim of this thesis is to understand the World as a full-fledged object, namely as the space of a society. This objective is at the same time necessary and problematic. It is necessary because the sudden end of the Cold War entailed the need of new conc ...
Les modèles itératifs sont très largement utilisés aujourd’hui en CAO. Ils permettent, avec un nombre restreint de paramètres, de représenter des formes relativement complexes par l’intermédiaire d’un algorithme qui applique un certain procédé de subdivisi ...
