BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Continuum limits for minimal paths - Alfred Hero (University of Mi
 chigan)
DTSTART:20160713T141500Z
DTEND:20160713T144500Z
UID:TALK66735@talks.cam.ac.uk
CONTACT:INI IT
DESCRIPTION:Many&nbsp\; applications involve computing minimal paths over 
 the nodes of a graph relative to a measure of pairwise node dissimilarity.
  These include minimal spanning trees in computer vision\, shortest paths 
 in image databases\, or&nbsp\; non-dominated anti-chains in multi-objectiv
 e database search. When the&nbsp\; nodes are random vectors and the dissim
 ilarity is an increasing function of Euclidean distance these minimal path
 s can have continuum limits as the number of nodes approaches infinity. Su
 ch continuum limits can lead to low complexity diffusion approximations to
 &nbsp\; the solution of the combinatorial minimal path problem.
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR