UWTV Program: Discrete Global Minimization Algorithms
Note: Selected programs are available for streaming download per agreement with the original media source.
Sponsored by:
Discrete Global Minimization Algorithms
Steven Gortler demonstrates how global optima can be found as the limit of a set of purely combinatorial problems. These combinatorial problems can be thought of higher dimensional analogues of the 'shortest path in planar graph' problems. He explains how these combinatorial problems can be solved in polynomial time by reducing them to instances of MIN-CUT.

Windows Media
 * Help?
QuickTime
 * Help?
Series Title:CSE Colloquia - 2005
Subject(s):Engineering and Computer Science
Speaker(s): Steven Gortler, Harvard University
Production Date: 01/04/2005
Runtime: 00:51:58
Support for UWTV is provided by:

San Jose State @ UW
Watch 9/3 at 8 p.m.
Original Game: 11/16/96

Kansas State @ UW
Watch 9/6 at 7 p.m.
Original Game: 9/28/91

Contact Us | Help | Where to Watch UWTV | Retransmission | UWTV Production | uw2.tv
Email us with comments or questions or call 888-616-UWTV

Copyright © University of Washington, 1997-2010. All Rights Reserved.