BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//MIDAS - ECPv5.1.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:MIDAS
X-ORIGINAL-URL:https://midas.umich.edu
X-WR-CALDESC:Events for MIDAS
BEGIN:VTIMEZONE
TZID:America/Detroit
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20180311T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20181104T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Detroit:20180112T160000
DTEND;TZID=America/Detroit:20180112T170000
DTSTAMP:20211209T034650
CREATED:20170927T190533Z
LAST-MODIFIED:20190806T173546Z
UID:22386-1515772800-1515776400@midas.umich.edu
SUMMARY:Ioana Dumitriu\, PhD\, University of Washington - MIDAS Seminar Series
DESCRIPTION: \nIoana Dumitriu\, PhD\nDepartment of Mathematics\nUniversity of Washington\n \nRECORDING\nSlides\n \n“Larger\, Faster\, Random(ized): Computing in the Era of Big Data”\n \nAbstract: Our capacity to produce and store large sets of data has increased exponentially over the course of the last two decades; the development of algorithms for sifting through it efficiently is somewhat lagging behind. Randomization is being recognized as a powerful tool\, whether in constructing models on which algorithms can be tested\, or in sampling the data reliably\, or in speeding up and optimizing existing algorithms. In particular\, basic results from random matrix and random graph theory are being employed at the forefront of scientific computing; often\, assembling algorithms and producing theoretical guarantees for them requires a blend of probability\, combinatorics\, graph theory\, numerical analysis\, and optimization. \nDr. Dumitriu will speak about three results; the first on Community Detection using the Stochastic Block Model; the second on the spectral gap in bipartite biregular graph and its potential applications; and the third in which randomization is used to achieve a communication-minimizing non-symmetric eigenvalue solver This is joint work with Maryam Fazel\, Roy Han\, and Amin Jalali; Gerandy Brito and Kameron Harris; respectively\, Jim Demmel and Grey Ballard. \nBio: Ioana Dumitriu is a Professor of Mathematics at University of Washington. Her research spans numerical analysis and scientific computing\, random matrix and random graph theory\, and probabilistic and algorithmic combinatorics. She earned her BS from NYU in 1999 and her PhD from MIT in 2003; she spent three years in Berkeley as a postdoctoral Miller fellow\, and since 2006 she has been at University of Washington. Among her honors are an Honorable Mention in the Householder Prize for numerical linear algebra (2005) and the Leslie Fox Prize for numerical analysis (2007); she was the recipient of an NSF Career Award (DMS 0847661) and she was named a Fellow of the American Mathematical Society in 2012. \n \nFor more information on MIDAS or the Seminar Series\, please contact midas-contact@umich.edu. MIDAS gratefully acknowledges Northrop Grumman Corporation for its generous support of the MIDAS Seminar Series. \n
URL:https://midas.umich.edu/event/ioana-dumitriu/
LOCATION:Weiser Hall\, 10th Floor\, 500 Church Street\, Ann Arbor\, MI\, 48109\, United States
CATEGORIES:MIDAS Weekly Seminar Series
END:VEVENT
END:VCALENDAR