BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/879
DTSTAMP:20230914T125942Z
SUMMARY:Randomized Algorithms in Linear Algebra
DESCRIPTION:Speaker: Ravi Kannan (Microsoft Research India\nBangalore)\n\nA
bstract: \nA small random sample of rows/columns of any matrix is a decent
proxy for the matrix\, provided sampling probabilities are proportional t
o squared lengths. Since the early theorems on this from the 90's\, there
has been a substantial body of work using sampling (with more sophisticate
d probabilities) to reduce matrix sizes for Linear Algebra computations.Th
e talk will describe theorems\, applications and challenges in the area.\n
URL:https://www.tcs.tifr.res.in/web/events/879
DTSTART;TZID=Asia/Kolkata:20180606T170000
DTEND;TZID=Asia/Kolkata:20180606T180000
LOCATION:AG-66 (Lecture Theatre)
END:VEVENT
END:VCALENDAR