Talks will usually be at 4:00 Tuesdays and Fridays. Please note individual days and times given below. Room TBA. There will be refreshments before all talks in O'Connor 31 starting around 3:30pm. Several talks this quarter will be by job candidates.
Title: Positivity for bihomogeneous polynomials
UNFORTUNATELY, this presentation has been cancelled.
I discuss a complex variables analog of Hilbert's 17th problem. David Catlin and I used operator theory to give a surprising characterization of positive bihomogeneous polynomials. I give several applications and generalizations, and interpret them in terms of metrics on line bundles over complex projective spaces. The talk can be understood by any mathematician.
Anyone wishing further information about any of these talks should contact the coordinator of the Colloquium Series, Prof. Ed Schaefer, firstname.lastname@example.org
Title: Competitive algorithms for the list update problem.
Often we must make decisions with incomplete information about the future. For example, a doctor must schedule appointments with patients as they request them, without knowing the scheduling conflicts that may arise when other patients later wish to arrange appointments.
How can we evaluate algorithms that work with such incomplete information? In this talk, I will introduce competitive analysis and explain why it is a useful measure of algorithm performance. We will also analyze a simple yet surprisingly interesting problem, the list update problem, using competitive analysis.
This page maintained by Dennis C. Smolarski, S.J. Comments should be sent to email@example.com. Last updated March 3, 1997.