Continuum limits for minimal paths

Add to your list(s) Download to your calendar using vCal

• Alfred Hero (University of Michigan)
• Wednesday 13 July 2016, 15:15-15:45
• Seminar Room 1, Newton Institute.

If you have a question about this talk, please contact INI IT.

SNAW01 - Graph limits and statistics

Many  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  non-dominated anti-chains in multi-objective database search. When the  nodes are random vectors and the dissimilarity is an increasing function of Euclidean distance these minimal paths can have continuum limits as the number of nodes approaches infinity. Such continuum limits can lead to low complexity diffusion approximations to  the solution of the combinatorial minimal path problem.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Featured lists
• INI info aggregator
• Interested Talks
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• Seminar Room 1, Newton Institute
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.