BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:CAS FPGA Talks
SUMMARY:Predicting minimal error bounds through an algorit
 hm - David Boland ( Imperial College London)
DTSTART;TZID=Europe/London:20090219T120000
DTEND;TZID=Europe/London:20090219T130000
UID:TALK16095AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/16095
DESCRIPTION:The amount of precision used in an algorithm trade
 s error for silicon area usage and potential paral
 lelism. This talk will explain the cause of floati
 ng point error in computations and show how simple
  polynomials can be used to describe this error. I
 t will then attempt to describe some background th
 eory which is intended to be used on these polynom
 ials to find tight bounds on the final error in an
 y algorithm. Finally\, it will then display some s
 imple examples to illustrate the use of this theor
 y & highlight some of the complexities in creating
  a general algorithm to use this theory to find mi
 nimal error bounds.
LOCATION:Mahanakorn Laboratory\, EEE
CONTACT:Dr George A Constantinides
END:VEVENT
END:VCALENDAR