Algorithms Seminar

Time: Mondays, 1 - 2pm. Location: D344.

Past semesters: Spring 2006, Fall 2005, Spring 2005, Fall 2004, Spring 2004, Fall 2003.

September 11	Computing Kemeny and Slater Rankings (abstract)	Vincent Conitzer
September 18	Matching under the RMS Distance: Theory and Practice (abstract)	Jeff Phillips
September 25	The Complexity of Diffuse Reflections in a Simple Polygon (abstract)	Albert Yu

October 2	Asymptotically Optimal Kinodynamic Motion Planning for Self-Reconfigurable Robots (abstract)	Sam Slee
October 16	Complexity of Delaunay Triangulation for Points on Lower-dimensional Polyhedra (abstract)	Dominique Attali
October 23	Categories and Structures for Computational Topology (abstract)	Denis Blackmore
October 30	Variable and Feature Selection via Learning Gradients (abstract)	Qiang Wu

November 6	Active Learning (abstract)	Kamesh Munagala
November 13	Scalable Recognition with a Vocabulary Tree and Using Galois Theory to Prove that Structure from Motion Algorithms are Optimal (abstract)	David Nister
November 17 at 3pm	Surface and Medial Axis Topology Through Distance Flows Induced by Discrete Samples (abstract)	Bardia Sadri
November 20	Multiscale Analysis of Diffusion Processes on Graphs and Analysis of High-dimensional Data (abstract)	Mauro Maggioni
November 27 at 3pm	Discrete Exterior Calculus and Application to Quadrangulation (abstract)	Yiying Tong

December 4

Risk and Robust Optimization (abstract)