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.
In this paper, we propose a scalable algorithm for spectral embedding. The latter is a standard tool for graph clustering. However, its computational bottleneck is the eigendecomposition of the graph Laplacian matrix, which prevents its application to larg ...
This thesis focuses on designing spectral tools for graph clustering in sublinear time. With the emergence of big data, many traditional polynomial time, and even linear time algorithms have become prohibitively expensive. Processing modern datasets requir ...
We define a conforming B-spline discretisation of the de Rham complex on multipatch geometries. We introduce and analyse the properties of interpolation operators onto these spaces which commute w.r.t. the surface differential operators. Using these result ...
Our visual perception of the world - seeing form and colour or navigating the environment - depends on the interaction of light and matter in the environment. Light also has a more fundamental role in regulating rhythms in physiology and behaviour, as well ...
In an era of new developments in nanomaterials analysis enabled by the unprecedented spatial and energy resolutions of electron energy-loss spectroscopy in the scanning transmission electron microscope (STEM-EELS), it remains that the vast majority of work ...
We introduce a high-order spline geometric approach for the initial boundary value problem for Maxwell's equations. The method is geometric in the sense that it discretizes in structure preserving fashion the two de Rham sequences of differential forms inv ...
We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal e ...
We construct a spectral sequence converging to the homology of the ordered configuration spaces of a product of parallelizable manifolds. To identify the second page of this spectral sequence, we introduce a version of the Boardman-Vogt tensor product for ...
In this thesis, we study the homotopical relations of 2-categories, double categories, and their infinity-analogues. For this, we construct homotopy theories for the objects of interest, and show that there are homotopically full embeddings of 2-categories ...
Can one reduce the size of a graph without significantly altering its basic properties? The graph reduction problem is hereby approached from the perspective of restricted spectral approximation, a modification of the spectral similarity measure used for g ...