Publication

Graph-based Methods for Visualization and Clustering

Publications associées (131)

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

Distributed Similarity Search in High Dimensions Using Locality Sensitive Hashing

Karl Aberer, Sebastian Michel, Parisa Haghani

In this paper we consider distributed K-Nearest Neighbor (KNN) search and range query processing in high dimensional data. Our approach is based on Locality Sensitive Hashing (LSH) which has proven very efficient in answering KNN queries in centralized set ...

2009

Some coloring and walking problems in graphs

Benjamin Leroy-Beaulieu

Graph theory is an important topic in discrete mathematics. It is particularly interesting because it has a wide range of applications. Among the main problems in graph theory, we shall mention the following ones: graph coloring and the Hamiltonian circuit ...

EPFL2008

Wavelets on Graphs via Spectral Graph Theory

Pierre Vandergheynst, Rémi Gribonval

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 ...

2008

On the estimation of geodesic paths on sampled manifolds after random projections

Pierre Vandergheynst, Matteo Sorci

In this paper, we focus on the use of random projections as a dimensionality reduction tool for sampled manifolds in high-dimensional Euclidean spaces. We show that geodesic paths approximations from nearest neighbors Euclidean distances are well-preserved ...

2008

LSH At Large - Distributed KNN Search in High Dimensions

Karl Aberer, Sebastian Michel, Parisa Haghani

We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay ne ...

2008

3D Face Recognition using Sparse Spherical Representations

Pascal Frossard, Effrosyni Kokiopoulou, Ivana Tosic, Roser Sala Llonch

This paper addresses the problem of 3D face recognition using spherical sparse representations. We first propose a fully automated registration process that permits to align the 3D face point clouds. These point clouds are then represented as signals on th ...

2008

Variations of coloring problems related to scheduling and discrete tomography

Bernard Ries

The graph coloring problem is one of the most famous problems in graph theory and has a large range of applications. It consists in coloring the vertices of an undirected graph with a given number of colors such that two adjacent vertices get different col ...

EPFL2007

Bicolored matchings in some classes of graphs

Dominique de Werra, Bernard Ries

We consider the problem of finding in a graph a set

R

of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with

n

nodes on each side, we give sufficient conditions f ...

2007

Complex network analysis of free-energy landscapes

Paolo De Los Rios, David Gfeller

The kinetics of biomolecular isomerization processes, such as protein folding, is governed by a free-energy surface of high dimensionality and complexity. As an alternative to projections into one or two dimensions, the free-energy surface can be mapped in ...

National Academy of Sciences2007

Orthogonal Neighborhood Preserving Projections

Effrosyni Kokiopoulou

Orthogonal Neighborhood Preserving Projections (ONPP) is a linear dimensionality reduction technique which attempts to preserve both the intrinsic neighborhood geometry of the data samples and the global geometry. The proposed technique constructs a weight ...

IEEE2005

Bicolored matchings in some classes of graphs

Dominique de Werra, Bernard Ries

We consider the problem of finding in a graph a set

R

of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with

n

nodes on each side, we give sufficient conditions f ...

2007