Brain Fingerprinting Using Fmri Spectral Signatures On High-Resolution Cortical Graphs
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.
Functional brain exploration methodologies such as functional magnetic resonance imaging (fMRI) are critical tools to study perceptual and cognitive processes. In order to develop complex and well-controlled fMRI paradigms, researchers are interested in us ...
We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite graph. We define a notion of scaling using the graph analogue of the Fourier domain, namely the space of eigenfunctions forming the sp ...
Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n-1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic ...
L1 and NCAM, two cell adhesion molecules of the immunoglobulin superfamily, have been implicated in the formation of neural circuits, synaptic plasticity, and cognitive function. In this study, we sought to investigate whether differences in the steady-sta ...
We introduce a simple erasure recovery algorithm for codes derived from cascades of sparse bipartite graphs and analyze the algorithm by analyzing a corresponding discrete-time random process. As a result, we obtain a simple criterion involving the fractio ...
Institute of Electrical and Electronics Engineers2001
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 ...
