Recherche

Afficher tous les résultats pour

Accueil

Concept

Matrice d'incidence

Science formelle
Mathématiques
Mathématiques discrètes
Théorie des graphes

Publications associées (24)

À propos
Confidentialité
Mentions légales

Graph Chatbot

On some algebraic and extremal problems in discrete geometry

Seyed Hossein Nassajianmojarrad

In the present thesis, we delve into different extremal and algebraic problems arising from combinatorial geometry. Specifically, we consider the following problems. For any integer

n\ge 3

, we define

e(n)

to be the minimum positive integer such that an ...

EPFL2017

From data to structures : graph learning under smoothness assumptions and applications in data science

Vasilis Kalofolias

Weighted undirected graphs are a simple, yet powerful way to encode structure in data. A first question we need to address regarding such graphs is how to use them effectively to enhance machine learning problems. A second but more important question is ho ...

EPFL2016

On sums of graph eigenvalues

Joachim Stubbe

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both the standard combi ...

Elsevier Science Inc2014

Learning Parametric Dictionaries for Signals on Graphs

Pascal Frossard, Ntorina Thanou, David Shuman

In sparse signal representation, the choice of a dictionary often involves a tradeoff between two desirable properties – the ability to adapt to specific signal data and a fast implementation of the dictionary. To sparsely represent signals residing on wei ...

Institute of Electrical and Electronics Engineers2014

Parametric dictionary learning for graph signals

Pascal Frossard, Ntorina Thanou, David Shuman

We propose a parametric dictionary learning algorithm to design structured dictionaries that sparsely represent graph signals. We incorporate the graph structure by forcing the learned dictionaries to be concatenations of subdictionaries that are polynomia ...

2013

Identification of genetic determinants and pharmacological modulators of mitochondrial function

Pénélope Andreux

Increased life expectancy goes hand in hand with a higher incidence of age-related diseases that affect the nervous and metabolic systems, such as type 2 diabetes, cancer, Parkinson’s and Alzheimer’s disease. These complex diseases are a product of the com ...

EPFL2013

Clustering with Multi-Layer Graphs: A Spectral Perspective

Pascal Frossard, Pierre Vandergheynst, Xiaowen Dong

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (users) with different edges (pairwise relationships). In this paper, we address ...

Institute of Electrical and Electronics Engineers2012

Whole-brain structural connectivity in temporal lobe epilepsy: a Diffusion Spectrum Imaging study

Jean-Philippe Thiran, Alessandra Griffa, Alessandro Daducci, Alia Lemkaddem, François Lazeyras

Introduction: Medial Temporal Lobe Epilepsy (mTLE) with hippocampal sclerosis is the most frequent cause of drug-resistant focal epilepsy in adults. These patients suffer from widespread subtle white matter abnormalities and abnormal functional connectivit ...

2012

A Game Theoretic Approach to Expander-based Compressive Sensing

Volkan Cevher, Sina Jafarpour

We consider the following expander-based compressive sensing (e-CS) problem: Given Φ ∈ ℝM×N (M

IEEE2011

A lower bound for algebraic connectivity based on the connection-graph-stability method

Martin Hasler, Ali Ajdari Rad, Mahdi Jalili

This paper introduces the connection-graph-stability method and uses it to establish a new lower bound on the algebraic connectivity of graphs (the second smallest eigenvalue of the Laplacian matrix of the graph) that is sharper than the previously publish ...

Elsevier2011

Page 2 sur 3