Max-Planck-Institut für Informatik
max planck institut
mpii logo Minerva of the Max Planck Society

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Algorithms Design Using Spectral Graph Theory
Speaker:Richard Peng
coming from:MIT
Speakers Bio:
Event Type:Talk
Visibility:D1, D2, D3, D4, D5, RG1, SWS, MMCI
We use this to send out email in the morning.
Level:AG Audience
Date, Time and Location
Date:Tuesday, 29 July 2014
Duration:30 Minutes
Building:E1 4
Spectral graph theory is the interplay between linear algebra and combinatorial graphs. Laplace’s equation and its discrete form, the Laplacian matrix, are becoming increasingly popular in optimization, image processing, and machine learning. This talk will discuss some key ideas in this Laplacian paradigm for designing efficient algorithms. They build upon tools from numerical analysis, graph algorithms, and random matrix theory.
Name(s):He Sun
Video Broadcast
Video Broadcast:NoTo Location:
Tags, Category, Keywords and additional notes
Attachments, File(s):
  • He Sun, 07/04/2014 01:04 PM
  • He Sun, 06/17/2014 10:17 AM -- Created document.