Publications associées à Programme d'Erlangen

Geodesic Distance on Optimally Regularized Functional Connectomes Uncovers Individual Fingerprints

Background: Functional connectomes (FCs) have been shown to provide a reproducible individual fingerprint, which has opened the possibility of personalized medicine for neuro/psychiatric disorders. Thus, developing accurate ways to compare FCs is essential ...

MARY ANN LIEBERT, INC2021

Sparse Inverse Problems Over Measures: Equivalence Of The Conditional Gradient And Exchange Methods

Armin Eftekhari

We study an optimization program over nonnegative Borel measures that encourages sparsity in its solution. Efficient solvers for this program are in increasing demand, as it arises when learning from data generated by a "continuum-of-subspaces" model, a re ...

SIAM PUBLICATIONS2019

Geometric deep learning: going beyond Euclidean data

Pierre Vandergheynst, Michael Bronstein

Many signal processing problems involve data whose underlying structure is non-Euclidean, but may be modeled as a manifold or (combinatorial) graph. For instance, in social networks, the characteristics of users can be modeled as signals on the vertices of ...

2017

Moment-sum-of-squares hierarchies for set approximation and optimal control

Milan Korda

This thesis uses the idea of lifting (or embedding) a nonlinear controlled dynamical system into an infinite-dimensional space of measures where this system is equivalently described by a linear equation. This equation and problems involving it are subsequ ...

EPFL2016

Flexible and Efficient Measurement of Dynamic Bytecode Metrics

Code instrumentation is finding more and more practical applications, but the required program transformations are often difficult to implement, due to the lack of dedicated, high-level tools. In this paper we present a novel instrumentation framework that ...

ACM Press2006