Home /  Workshop /  Schedules /  Efficient algorithms for bichromatic separability

Efficient algorithms for bichromatic separability

Mathematical Foundations of Geometric Algorithms October 13, 2003 - October 17, 2003

October 15, 2003 (11:30 AM PDT - 12:00 PM PDT)
Speaker(s): Boris Aronov (New York University)
Location: SLMath: Eisenbud Auditorium
Primary Mathematics Subject Classification No Primary AMS MSC
Secondary Mathematics Subject Classification No Secondary AMS MSC
Video

10326

249-1681-Efficient algorithms for bichromatic separability-Boris Aronov
Abstract No Abstract Uploaded
Supplements No Notes/Supplements Uploaded
Video/Audio Files

10326

Audio 10326-10326-AIFF.aiff 177 MB audio/x-aiff Download
DVD Video 10326-10326-MPEG-2.m2v 929 MB video/mpeg Download
Quicktime 10326-10326-Quicktime.mov 247 MB video/quicktime rtsp://videos.msri.org/10326/10326-10326-Quicktime.mov Download
H.264 Video 10326-10326.mp4 256 MB video/mp4 Download

249-1681-Efficient algorithms for bichromatic separability-Boris Aronov

H.264 Video 249-1681-Efficient_algorithms_for_bichromatic_separability-Boris_Aronov.mp4 31.2 MB video/mp4 Download
249-1681-Efficient_algorithms_for_bichromatic_separability-Boris_Aronov.rm 11.6 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.