BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
TZID:Europe/Paris
X-WR-TIMEZONE:Europe/Paris
BEGIN:VEVENT
UID:6779@i2m.univ-amu.fr
DTSTART;TZID=Europe/Paris:20200313T140000
DTEND;TZID=Europe/Paris:20200313T150000
DTSTAMP:20241120T202005Z
URL:https://www.i2m.univ-amu.fr/evenements/smoothing-graph-signals-via-ran
 dom-spanning-forests/
SUMMARY:Nicolas Tremblay\, Simon Barthelmé (GIPSA\, Grenoble): Smoothing g
 raph signals via random spanning forests
DESCRIPTION:Nicolas Tremblay\, Simon Barthelmé: Smoothing is one way to es
 timate an underlying graph signal from noisy measurements. This operation 
 can be explicitly written in terms of a simple graph filtering operation. 
 However\, on large graphs\,exact filtering becomes prohibitive computation
 ally and approximate methods are necessary. Two classical options are poly
 nomial approximations and conjugate gradient methods. We will discuss a no
 vel approach\, based on recent results on random spanning forests\,thereby
  uncovering another elegant link between the spectral information of a gra
 ph and random processes defined on it.\nReference: Yusuf Y. Pilavci\, Pier
 re-Olivier Amblard\, Simon Barthelmé\, Nicolas Tremblay "Smoothing graph 
 signal via random spanning forests" https://arxiv.org/abs/1910.07963\n\nNi
 colas TREMBLAY (GIPSA\, Grenoble)\nSimon BARTHELMÉ (GIPSA\, Grenoble)\n\n
 &nbsp\;
CATEGORIES:Séminaire,Signal et Apprentissage
LOCATION:I2M Chateau-Gombert - CMI\, Salle de Séminaire R164 (1er étage)\
 , 39 Rue Joliot Curie\, 13013 Marseille\, France\, Campus Château-Gombert
 \, 
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=39 Rue Joliot Curie\, 13013
  Marseille\, France\, Campus Château-Gombert\, ;X-APPLE-RADIUS=100;X-TITL
 E=I2M Chateau-Gombert - CMI\, Salle de Séminaire R164 (1er étage):geo:0,
 0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
END:VTIMEZONE
END:VCALENDAR