1. 1©MapR Technologies - Confidential Real-time Learning 2. 2©MapR Technologies - Confidential whoami – Ted Dunning  Chief Application Architect, MapR Technologies…

1. SOCIAL SCORES Supervised by Dr. Dilum Bandara E.A.M.M Edirisinghe 138211N 2. Outline • TunkRank – A Twitter Analog to PageRank • TwitterRank – Finding Topic-sensitive…

Slide 1Christian Sohler 1 HEINZ NIXDORF INSTITUT Universität Paderborn Algorithmen und Komplexität A Fast PTAS for k-Means Clustering Dan Feldman, Tel Aviv University,…

Slide 1Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO Based on a paper in STOC, 2012 Slide 2 k-party Number-In-Hand…

Slide 1Tight Bounds for Distributed Functional Monitoring David Woodruff IBM Almaden Qin Zhang Aarhus University MADALGO Slide 2 Distributed Functional Monitoring C P1P1…

Slide 115. 05. 2007 Observational Learning in Random Networks Julian Lorenz, Martin Marciniszyn, Angelika Steger Institute of Theoretical Computer Science, ETH Zürich Slide…

Slide 1The Power of Unentanglement Scott Aaronson (MIT) Salman Beigi (MIT) Andrew Drucker (MIT) | Bill Fefferman (Caltech) Peter Shor (MIT) | | Slide 2 It is not yet entirely…

Slide 1The Complexity of Agreement A 100% Quantum-Free Talk Scott Aaronson MIT Slide 2 People disagree. Why? Because some people are idiots? Because people care about things…

Slide 1Routing Complexity of Faulty Networks Omer Angel Itai Benjamini Eran Ofek Udi Wieder The Weizmann Institute of Science Slide 2 Routing in a Faulty Network Node u knows…

Slide 1The Average Case Complexity of Counting Distinct Elements David Woodruff IBM Almaden Slide 2 Problem Description Given a data stream of n insertions of records, count…