Approximate the 2-catalog segmentation problem using semidefinite programming relaxations
Semidefinite Programming and Applications October 07, 2002 - October 11, 2002
Location: MSRI: Simons Auditorium
Primary Mathematics Subject Classification
No Primary AMS MSC
Secondary Mathematics Subject Classification
No Secondary AMS MSC
241-1493-Approximate the 2-catalog segmentation problem using semidefinite programming relaxations-Yinyu Ye
 |
ye.pdf
|
Download |
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
|
Download |
|
241-1493-Approximate_the_2-catalog_segmentation_problem_using_semidefinite_programming_relaxations-Yinyu_Ye.rm
|
Download |
Please report video problems to itsupport@msri.org.
See more of our Streaming videos on our main VMath Videos page.