Concept

Structure d'incidence

Publications associées (28)

Spatial analysis of 10-year predicted risk and incident atherosclerotic cardiovascular disease: the CoLaus cohort

Stéphane Joost, Idris Guessous, David Nicolas De Ridder, Guillaume Jordan

Whether cardiovascular risk scores geographically aggregate and inform on spatial development of atherosclerotic cardiovascular diseases (ASCVD) remains unknown. Our aim is to determine the spatial distribution of 10-year predicted cardiovascular risk and ...

2024

Spectral Hypergraph Sparsifiers of Nearly Linear Size

Mikhail Kapralov, Jakab Tardos

Graph sparsification has been studied extensively over the past two decades, culminating in spectral sparsifiers of optimal size (up to constant factors). Spectral hypergraph sparsification is a natural analogue of this problem, for which optimal bounds on ...

IEEE COMPUTER SOC2022

Leveraging topology, geometry, and symmetries for efficient Machine Learning

Michaël Defferrard

When learning from data, leveraging the symmetries of the domain the data lies on is a principled way to combat the curse of dimensionality: it constrains the set of functions to learn from. It is more data efficient than augmentation and gives a generaliz ...

EPFL2022

The emergence of small-scale self-affine surface roughness from deformation

Till Junge

Most natural and man-made surfaces appear to be rough on many length scales. There is presently no unifying theory of the origin of roughness or the self-affine nature of surface topography. One likely contributor to the formation of roughness is deformati ...

AMER ASSOC ADVANCEMENT SCIENCE2020

Realizability of planar point embeddings from angle measurements

Majed El Helou, Adam James Scholefield, Frederike Dümbgen

Localization of a set of nodes is an important and a thoroughly researched problem in robotics and sensor networks. This paper is concerned with the theory of localization from inner-angle measurements. We focus on the challenging case where no anchor loca ...

2020

Acoustic Topological Fano Resonances

Romain Christophe Rémy Fleury, Farzad Zangeneh Nejad

Originally discovered in the context of quantum mechanics in 1961, the ultra-sharp spectrum of the Fano resonance has nowadays established itself as centerpiece in modern engineering for realizing a large variety of prominent devices including low energy s ...

2019

Saturation of Berge hypergraphs

Abhishek Methuku

Given a graph F, a hypergraph is a Berge-F if it can be obtained by expanding each edge in F to a hyperedge containing it. A hypergraph H is Berge-F-saturated if H does not contain a subhypergraph that is a Berge-F, but for any edge e is an element of E((H ...

ELSEVIER SCIENCE BV2019

Asyrnptotics for the Turan number of Berge-K-2,K-t

Abhishek Methuku

Let F be a graph. A hypergraph is called Berge-F if it can be obtained by replacing each edge in F by a hyperedge containing it. Let F be a family of graphs. The Turan number of the family Berge-F is the maximum possible number of edges in an r-uniform hyp ...

ACADEMIC PRESS INC ELSEVIER SCIENCE2019

Matching fields and lattice points of simplices

Georg Peter Loho

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

2018

Computational development of the nanoporous materials genome

Berend Smit, Peter George Boyd, Yongjin Lee

There is currently a push towards big data and data mining in materials research to accelerate discovery. Zeolites, metal-organic frameworks and other related crystalline porous materials are not immune to this phenomenon, as evidenced by the proliferation ...

Nature Publishing Group2017

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.

Connectez-vous pour utiliser Chat avec Graph Search