From 247833f94d58bae972151c3f30290cb654228768 Mon Sep 17 00:00:00 2001 From: Edgar Bering Date: Wed, 17 Feb 2010 15:27:10 -0500 Subject: [PATCH] adding Nick Harvey talk --- events.xml | 14 ++++++++++++++ 1 file changed, 14 insertions(+) diff --git a/events.xml b/events.xml index b7af655..3049bc9 100644 --- a/events.xml +++ b/events.xml @@ -4,6 +4,20 @@ + + +

In this talk Nicholas Harvey discusses the prevalence of randomized algorithms and their application to solving optimization problems on graphs; with startling results compared to deterministic algorithms. +

+ + +

For many problems, randomized algorithms are either the fastest algorithm or the simplest algorithm; +sometimes they even provide the only known algorithm. Randomized algorithms have become so prevalent +that deterministic algorithms could be viewed as a curious special case. In this talk I will describe +some startling examples of randomized algorithms for solving some optimization problems on graphs. +

+ +
+

Cairo is an open source, cross platform, vector graphics library with the ability to output to many kinds of surfaces, including PDF, SVG and PNG surfaces, as well as X-Window, Win32 and Quartz 2D backends. Unlike the raster graphics used with programmes and libraries such as The Gimp and ImageMagick, vector graphics are not defined by grids of pixels, but rather by a collection of drawing operations. These operations detail how to draw lines, fill shapes, and even set text to create the desired image. This has the advantages of being infinitely scalable, smaller in file size, and simpler to express within a computer programme. This talk will be an introduction to the concepts and metaphors used by vector graphics libraries in general and Cairo in particular.