diff --git a/Makefile b/Makefile index 1ddf5e3..7338279 100644 --- a/Makefile +++ b/Makefile @@ -1,4 +1,4 @@ -SHELL = umask 002; exec /bin/sh +SHELL = umask 002 ; exec /bin/sh FILES = events.ics events.atom news.atom index.html stats.html \ favicon.ico default.css csclub.der csclub.pem robots.txt diff --git a/events.xml b/events.xml index f3cd7c0..67f5f24 100644 --- a/events.xml +++ b/events.xml @@ -5,6 +5,36 @@ + + +

+ Come to this exciting talk about path-finding algorithms which + is being presented by Professor Anna Lubiw. +

+ + +

+ Finding shortest paths is a problem that comes up in many applications: + Google maps, network routing, motion planning, connectivity in social + networks, and etc. + The domain may be a graph, either explicitly or implicitly represented, + or a geometric space. +

+

+ Professor Lubiw will survey the field, from Dijkstra's foundational algorithm to + current results and open problems. + There will be lots of pictures and lots of ideas. +

+

+ Click here to see the slides from the talk. +

+

+ Click here for the recorded talk. +

+ + + diff --git a/media/index.xml b/media/index.xml index a02b715..1ddbee9 100644 --- a/media/index.xml +++ b/media/index.xml @@ -11,6 +11,26 @@ CD or DVD should you so choose.