adding Nick Harvey talk

This commit is contained in:
Edgar Bering 2010-02-17 15:27:10 -05:00
parent f43476dcd1
commit 247833f94d
1 changed files with 14 additions and 0 deletions

View File

@ -4,6 +4,20 @@
<eventdefs>
<!-- Winter 2010 -->
<eventitem date="2010-02-23" time="04:30 PM" room="MC5136B" title="The Best Algorithms are Randomized Algorithms">
<short><p>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.
</p></short>
<abstract><p>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.
</p></abstract>
</eventitem>
<eventitem date="2010-02-09" time="4:30 PM" room="DC1304" title="An Introduction to Vector Graphics Libraries with Cairo">
<short><p>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.