BEGIN:VCALENDAR
METHOD:PUBLISH
VERSION:2.0
PRODID:-//Cornell U. Department of Computer Science//Brown Bag Seminar//EN
BEGIN:VEVENT
SUMMARY:Brown bag: David Bindel
DESCRIPTION:Title: Mutating Matrices from a Gamut of Graphs: A Play in
Two Acts\nSpeaker: David Bindel\nAbstract: In this talk\, I give an
overview of two recent results\, both of which\nfeature methods to
reason about parametric family of linear systems\nfrom the analysis of
different types of networks.\n\nIn the first part\, I will describe our
work on estimating changes to\ntopology in the bulk power transmission
network on the basis of\nscattered measurements. Our method compares
the signal we actually\nsee to change predicted under various
contingencies\, and ranks the\ncontingencies by how well the prediction
matches the observation. The\nkey technical insight in our approach is
that standard updating\nformulas can be combined with lower bounds to
rule out most\ncontingencies with a very cheap computation.\n\nIn the
second part of the talk\, I will describe work on model\nreduction for
fast computation of PageRank for graphs in which the\nedge weights
depend on parameters. For an example learning-to-rank\napplication\,
our approach is nearly five orders of magnitude faster\nthan the
standard approach. This speed improvement enables\ninteractive
computation of a class of ranking results that previously\ncould only be
computed offline.
LOCATION:Gates 122
UID:2015-02-24
STATUS:CONFIRMED
DTSTART:20150224T170000Z
DTEND:20150224T180000Z
LAST-MODIFIED:20150219T203025Z
ORGANIZER;CN=Jonathan Shi:http://www.cs.cornell.edu/~jshi/brownbag/
DTSTAMP:20240222T045218Z
END:VEVENT
END:VCALENDAR