Home /  Workshop /  Schedules /  Approximate the 2-catalog segmentation problem using semidefinite programming relaxations

Approximate the 2-catalog segmentation problem using semidefinite programming relaxations

Semidefinite Programming and Applications October 07, 2002 - October 11, 2002

October 11, 2002 (11:30 AM PDT - 12:30 PM PDT)
Speaker(s): Yinyu Ye (Stanford University)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

241-1493-Approximate the 2-catalog segmentation problem using semidefinite programming relaxations-Yinyu Ye
Abstract No Abstract Uploaded
Supplements
Asset no preview ye.pdf 169 KB application/pdf Download
Video/Audio Files

241-1493-Approximate the 2-catalog segmentation problem using semidefinite programming relaxations-Yinyu Ye

H.264 Video 241-1493-Approximate_the_2-catalog_segmentation_problem_using_semidefinite_programming_relaxations-Yinyu_Ye.mp4 36.8 MB video/mp4 Download
241-1493-Approximate_the_2-catalog_segmentation_problem_using_semidefinite_programming_relaxations-Yinyu_Ye.rm 13.5 MB application/vnd.rn-realmedia Download
Troubles with video?

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.