Publication

Who links to whom: mining linkage between Web sites

Publications associées (73)

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

Graph-based denoising for time-varying point clouds

Pierre Vandergheynst, Johann Paratte, Yann Mikaël Schoenenberger

Noisy 3D point clouds arise in many applications. They may be due to errors when creating a 3D model from images or simply to imprecise depth sensors. Point clouds can be given geometrical structure using graphs created from the similarity information betw ...

2015

Downsampling of Signals on Graphs Via Maximum Spanning Trees

Quy Ha Nguyen, Minh Do

Downsampling of signals living on a general weighted graph is not as trivial as of regular signals where we can simply keep every other samples. In this paper we propose a simple, yet effective downsampling scheme in which the underlying graph is approxima ...

Ieee-Inst Electrical Electronics Engineers Inc2015

From Compact Semi-Toric Systems To Hamiltonian S-1-Spaces

Silvia Sabatini

We show how any labeled convex polygon associated to a compact semi-toric system, as de fined by V (u) over tilde Ngoc, determines Karshon's labeled directed graph which classifies the underlying Hamiltonian S-1-space up to isomorphism. Then we characteriz ...

Amer Inst Mathematical Sciences2015

Enhanced Matrix Completion with Manifold Learning

Pierre Vandergheynst, Michael Bronstein, Xavier Bresson, Vasilis Kalofolias

We study the problem of matrix completion when infor- mation about row or column proximities is available, in the form of weighted graphs. The problem can be formulated as the optimization of a convex function that can be solved efficiently using the alter ...

2015

Parametric dictionary learning for graph signals

Pascal Frossard, 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

Privacy and Dynamics of Social Networks

Pedram Pedarsani

Over the past decade, investigations in different fields have focused on studying and understanding real networks, ranging from biological to social to technological. These networks, called complex networks, exhibit common topological features, such as a h ...

EPFL2013

Graph-based representation and coding of multiview geometry

Pascal Frossard, Thomas Maugey

We propose a new approach for describing the geometry information of multiview image representations. Rather than transmitting the raw geometry of the scene, under the form of depth information, we build a graph that represents the connections between corr ...

2013

Hardness of Vertex Deletion and Project Scheduling

Ola Nils Anders Svensson

Assuming the Unique Games Conjecture, we show strong inapproximability results for two natural vertex deletion problems on directed graphs: for any integer k ≥ 2 and arbitrary small ε > 0, the Feedback Vertex Set problem and the DAG Vertex Deletion problem ...

Springer2012

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

A Windowed Graph Fourier Transform

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized transla ...

Ieee2012