<html><head><meta http-equiv="Content-Type" content="text/html charset=us-ascii"></head><body style="word-wrap: break-word; -webkit-nbsp-mode: space; -webkit-line-break: after-white-space;" class=""><div class=""><div class=""><span class="" style="font-size: 14px;"><b class="" style="font-family: LucidaGrande; background-color: rgba(255, 255, 255, 0);"><u class="">Department of Computer Science </u></b><b class="" style="background-color: rgba(255, 255, 255, 0); font-family: LucidaGrande;"><u class="">Seminar</u></b></span></div></div><div class="" style="font-family: LucidaGrande;"><span class="" style="background-color: rgba(255, 255, 255, 0);"><br class=""></span></div><div class=""><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">Monday, March 13, 2017</span></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">2:30 pm</span></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">Ryerson 251 </span></div><div class="" style="font-family: LucidaGrande;"><br class=""></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">Benjamin Moseley</span></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">(Washington University in St. Louis)</span></div><div class="" style="font-family: LucidaGrande;"><br class=""></div><div class=""><span class="" style="font-size: 14px;"><span class="" style="font-family: LucidaGrande;">Title: </span><span style="font-family: LucidaGrande;" class="">Algorithmic Methods for Massively Parallel Data Science</span><br class="gmail-m_4827095062818533991gmail_msg"><br class="gmail-m_4827095062818533991gmail_msg"><span class="" style="font-family: LucidaGrande;">Abstract: </span></span></div><div class=""><font face="LucidaGrande" class=""><span style="font-size: 14px;" class="">This talk is concerned with designing algorithms for large scale data science using massively parallel computation. The talk discusses models and algorithms for frameworks such as MapReduce and Spark. The constraints of the models are well connected to practice, but pose challenging algorithmic restrictions. This talk introduces recent developments that overcome these challenges, widely applicable massively parallel algorithmic techniques and key questions on the theoretical foundations of massively parallel computation. The methods introduced will be applied to large data problems that are central to the data analytic community, submodular function optimization and dynamic programming.<br class=""><br class="">The work in this talk has been supported by Google, Yahoo and the NSF.<br class=""></span></font><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span></div><div class=""><font face="LucidaGrande" class=""><span class=""><span class=""><br class=""><span class="" style="font-size: 14px;">-----</span><br class=""></span><span class="" style="font-size: 14px;"> </span><span class="" style="font-size: 14px;"><br class=""></span></span></font><span class="" style="font-size: 14px;"><span class="" style="font-family: 'Lucida Grande';">Bio: </span></span><span style="font-family: LucidaGrande; font-size: 14px;" class="">Benjamin Moseley joined the Department of Computer Science & Engineering at Washington University in St. Louis in July 2014. Previously, Moseley was a Research Assistant Professor at</span><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span><span style="font-family: LucidaGrande; font-size: 14px;" class="">the Toyota Technological Institute at Chicago from 2012 to 2014, has frequently been affiliated with Yahoo Research and was a visiting scientist at Sandia National Laboratories. He received</span><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span><span style="font-family: LucidaGrande; font-size: 14px;" class="">his Ph.D. in computer science from the University of Illinois at Urbana-Champaign (Illinois) in 2012.</span><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span></div><br style="font-family: LucidaGrande; font-size: 14px;" class=""><span style="font-family: LucidaGrande; font-size: 14px;" class="">Moseley received the Best Paper Award at the 2015 International Parallel and Distributed Processing Symposium (IPDPS), the Best Paper Award at the 2013 Symposium on Parallelism in</span><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span><span style="font-family: LucidaGrande; font-size: 14px;" class="">Algorithms and Architectures (SPAA), and the Best Student Paper Award at the 2010 Symposium on Discrete Algorithms (SODA). He co-organizes the bi-annual meeting, "New Challenges</span><span style="font-family: LucidaGrande; font-size: 14px;" class=""> </span><span style="font-family: LucidaGrande; font-size: 14px;" class="">in Scheduling Theory'' and is an associate editor of Operations Research Letters.</span><br style="font-family: LucidaGrande; font-size: 14px;" class=""><div class=""><div class=""><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;"><br class=""></span></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;"><br class=""></span></div></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;">Host: Mike Franklin</span></div><div class="" style="font-family: LucidaGrande;"><span class="" style="font-size: 14px;"><br class=""></span></div><div class="" style="font-family: LucidaGrande;"><font size="2" class="">Refreshments in Ry. 255 after the talk</font></div></div></div><div class=""><br class="Apple-interchange-newline">
</div>
<br class=""></body></html>