Efficient Compression of Generic Function Dispatch Tables
Date	Friday, August 17, 2001
Time	2-3pm
Speaker	Eric Kidd
Affiliation	MIT
Abstract	A generic function is similar to an overloaded operator, but provides a way to select an appropriate behavior at run-time instead of compile-time. Dujardin and colleagues have proposed an algorithm for building and compressing generic function dispatch tables. I present several modifications to their algorithm, including an improvement to Pseudo-Closest-Poles and two new algorithms for compressing pole tables. The two new compression algorithms are simple and fast, and one produces smaller output than the original.
Location	545 Technology Square (aka "NE43")
Room	8th Floor Playroom
Bio	MIT AI Lab Summer Staff