BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/187
DTSTAMP:20230914T125914Z
SUMMARY:Dyadic Rounding
DESCRIPTION:Speaker: Amit Deshpande\nMicrosoft Research Lab.\,\n“Scie
 ntia”\n196/36 2nd Main\nSadashivnagar\nBangalore 560 080\n\nAbstract
 : \n`Dyad' means a pair\, `dyadic' means binary\, and in this talk I'll pr
 esent some simple algorithms for rounding real vectors to 0-1 vectors with
 out losing much. In particular\, we can round eigenvectors of real matrice
 s to 0-1 vectors with only a small log-factor loss. This leads to interest
 ing decompositions of real matrices into a small number of cut matrices --
  each of which looks like a block of ones with zeroes all around (up to so
 me multiple) -- and can be thought of as rounding the singular value decom
 position (joint work with Ravindran Kannan and Nikhil Srivastava).\n\nThe 
 talk will be elementary and all are encouraged to attend.\n
URL:https://www.tcs.tifr.res.in/web/events/187
DTSTART;VALUE=DATE:20110421
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR