University of Cambridge > > Isaac Newton Institute Seminar Series > Continuum limits for minimal paths

Continuum limits for minimal paths

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

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.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity