Concept

Laplacien discret

Publications associées (68)

An Anisotropic Error Estimator For The Crank-Nicolson Method: Application To A Parabolic Problem

In this paper we derive two a posteriori upper bounds for the heat equation. A continuous, piecewise linear finite element discretization in space and the Crank-Nicolson method for the time discretization are used. The error due to the space discretization ...

2009

Early consensus in complex networks under variable graph topology

Martin Hasler, Leonidas Georgopoulos

Analysis of the linear algorithm for consensus on complex networks shows the existence of two distinct phases, the asymptotic and the transient. The network reaches the asymptotic when the components corresponding to the spectral gap eigenvalue of the weig ...

IEEE2009

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

Some Issues on the p-Laplace Equation in Cylindrical Domains

We investigate the asymptotic behavior of the solution to equations of the p-Laplacian type in cylindrical domains becoming unbounded and address some issues regarding the solution in unbounded domains. ...

2008

Identification modale numérique-expérimentale des propriétés élastiques et dissipatives de matériaux composites

Marco Matter

Composite materials undoubtedly belong to one of the most studied classes of materials nowadays. In order to model the behaviour of mechanical structures made of this type of materials, it is necessary to know their constitutive properties. The varieties o ...

EPFL2008

Spectral coarse graining and synchronization in oscillator networks

Paolo De Los Rios, David Gfeller

Coarse graining techniques offer a promising alternative to large-scale simulations of complex dynamical systems, as long as the coarse-grained system is truly representative of the initial one. Here, we investigate how the dynamical properties of oscillat ...

American Physical Society2008

Deriving scalar maps from Diffusion Spectrum MRI

Jean-Philippe Thiran, Reto Meuli, Patric Hagmann, Leila Cammoun, Xavier Gigandet, Van Jay Wedeen

Whole brain DSI acquisitions are now clinically feasible. It is therefore necessary to have scalar maps available in order to easily visualize summary statistics of the full 3D diffusion pdf available in every voxel. We show how to derive from DSI not only ...

IEEE2007

Joint acoustic-video fingerprinting of vehicles, part II

Volkan Cevher

In this second paper, we first show how to estimate the wheelbase length of a vehicle using line metrology in video. We then address the vehicle fingerprinting problem using vehicle silhouettes and color invariants. We combine the acoustic metrology and cl ...

2007

Analysis of coordination in multi-agent systems through Partial difference Equations. Part II: Nonlinear control

Giancarlo Ferrari Trecate

In this second part of the paper we exploit the framework of Partial difference Equations (PdEs) over graphs for analyzing the behavior of multi-agent systems equipped with potential field based control schemes. We consider agent dynamics affected by error ...

2005

Robust watermarking of point-sampled geometry

Mark Pauly

We present a new scheme for digital watermarking of point-sampled geometry based on spectral analysis. By extending existing algorithms designed for polygonal data to unstructured point clouds, our method is particularly suited for scanned models, where th ...

2004

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