MADALGO ― Center for Massive Data Algorithmics MADALGO is a major new basic research center funded by The Danish National Research Foundation initially.

Slides:



Advertisements
Similar presentations
Stephen Mathews Chief Executive Service Innovation The Cedar Foundation Approach ESF Programme Launch October
Advertisements

Master Thesis Algorithms. Algorithms – Who? Faculty Lars Arge Gerth Stølting Brodal Gudmund Skovbjerg Frandsen Kristoffer Arnsfelt Hansen Peter Bro Miltersen.
Kandidatorientering, April 20, 2012 Algorithms and Data Structures.
Lars Arge Gerth Stølting Brodal Algorithms and Data Structures Computer Science Day, Department of Computer Science, Aarhus University, May 31, 2013.
Master Thesis Preparation Algorithms Gerth Stølting Brodal.
Algorithms and Data Structures Group Gerth Stølting Brodal Faculty Meeting, Department of Computer Science, Aarhus University, October 3, 2014.
Kandidatorientering, November 1, 2010 Algorithms and Data Structures.
Kandidatorientering, October 28, 2011 Algorithms and Data Structures.
Towards a London Institute of Cosmology? Based on brainstorming at a previous LCDM followed up with Ofer Lahav.
Implementing the Five Year Forward View New Models of Care Emily Hough Senior Strategy Advisor, NHS England January 2014.
By: Janet Mawiyoo – Chief Executive Officer Promoting Transparency in CSOs in Kenya.
Whole site approach to improvement Leading the Learning Workshop 3 - for leadership teams in secondary sites Quality, Improvement & Effectiveness Unit.
Lasse Deleuran 1/37 Homotopic Polygonal Line Simplification Lasse Deleuran PhD student.
DECO3008 Design Computing Preparatory Honours Research KCDCC Mike Rosenman Rm 279
Gerth Stølting Brodal Universitets-Samvirket Århus, Statsbiblioteket, Århus, November 16, 2010 Udfordringer ved håndtering af massive datamængder: Forskingen.
Computer Science Day 2008 Algorithms and Data Structures for Faulty Memory Gerth Stølting Brodal Department of Computer Science, University of Aarhus,
1 © ACADEMY OF FINLAND Academy of Finland 2014: Research knows no boundaries Tiina Jokela PhD, Senior Science Adviser, Strategic Research.
A warm welcome To the PBL academy opening day
Lars Arge 1/14 A A R H U S U N I V E R S I T E T Department of Computer Science Efficient Handling of Massive (Terrain) Datasets Professor Lars Arge University.
Massive Data Algorithmics Faglig Dag, January 17, 2008 Gerth Stølting Brodal University of Aarhus Department of Computer Science.
Comparison Based Dictionaries: Fault Tolerance versus I/O Efficiency Gerth Stølting Brodal Allan Grønlund Jørgensen Thomas Mølhave University of Aarhus.
The Danish Research Council for the Humanities (FKK) One of five councils within the Danish Council for Independent Research (DFF) DFF: Bottom-up research.
Lars Arge 1/12 Lars Arge. 2/12  Pervasive use of computers and sensors  Increased ability to acquire/store/process data → Massive data collected everywhere.
FAKULTÄT INFORMATIK OUTPUT.DD  research projects  student research projects  ca. 800 visitors  national joint venture  Innovationsforum Schülerrechenzentrum.
PROBABILITY REVIEW PART 9 CONDITIONAL PROBABILITY II Thomas Tiahrt, MA, PhD CSC492 – Advanced Text Analytics.
NSF for Older People Dr. Gareth Morgan NSF for Older People Project Manager.
Retreat Sandbjerg, November 19-20, Homework Session 16:30 Homework handout 16:40 Homework 19:00 Dinner 21:00 Homework presentations.
Mobility Services for All Americans Initiative ITS JPO Lead: Yehuda Gross Technical Lead: Brian Cronin/William Wiggins, FTA APTS Division.
© UNT in partnership with TEA1 7 th Grade Career Exploration Module Career Focus: Video Game Programmer Occupation.
Problems and MotivationsOur ResultsTechnical Contributions Membership: Maintain a set S in the universe U with |S| ≤ n. Given an x in U, answer whether.
Computer Science in a Nutshell Eugene Fink
Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.
Investigating Open Learning Institute of Virtual Education (Olive) Systems Success: An application of the DeLone and McLean Model of Information Systems.
Guiding Principles. Goals First we must agree on the goals. Several (non-exclusive) choices – Want every CS major to be educated in performance including.
ALCIC - Advanced Level Computing & ICT Courses 1 Year 11 Advanced VCE/GCE Selection Advanced Level Computing and Information & Communications Technology.
MotivationFundamental ProblemsProblems on Graphs Parallel processors are becoming common place. Each core of a multi-core processor consists of a CPU and.
The Certified Private Equity Professional (CPEP) Designation
Endowed by Chair of Future Communication Faculty of Computer Science Prof. Dr. K. Tutschku PhD Course Introduction Future Network Architectures and Experimentation.
Algorithms and Data Structures Gerth Stølting Brodal Computer Science Day, Department of Computer Science, Aarhus University, May 25, 2012.
Trends in IT Research: Experiences from Katrinebjerg and BRICS Ivan Damgård, Århus University.
ALL India Institute of Local Self Government. ABOUT AIILSG  83 years of service to the nation  People first  Premier Institute of Self Governance 
References [1] Pankaj Agarwal, Lars Arge and Andrew Danner. From Point Cloud to Grid DEM: A Scalable Approach. In Proc. 12th Intl. Symp. on Spatial Data.
1 © ACADEMY OF FINLAND Academy of Finland 2012: Research knows no boundaries Tiina Kotti PhD, Programme Manager, Programme Unit.
ProblemAssumption and PreliminariesAlgorithm  How does the water flow and depressions fill during non-uniform rain over a terrain?  Can we efficiently.
Comparison of Student Learning in Challenge-based and Traditional Instruction in Biomedical Engineering Others: Taylor Martin, Stephanie D. Rivale, and.
Link Building and Communities in Large Networks Martin Olsen University of Aarhus Link Building Link Building is NP-Hard The dashed links show the set.
MotivationKinetic Data StructuresExampleKDS Properties Networks play a central role in numerous applications, and the design of good networks is therefore.
What is a metric embedding?Embedding ultrametrics into R d An embedding of an input metric space into a host metric space is a mapping that sends each.
Headlines - Font: Ariel, Size:32, white Breadtext: Font: Ariel, Size: 22, color white This is a table cell with color RGB 96,96,96 Headline Running text.
IntroductionReduction to Arrangements of Hyperplanes We keep the canonical triangulation (bottom, left corner triangulation) of each convex cell of the.
Clinical Research Informatics [CRI]. Informatics, defined generally as the intersection of information and computer science with a health-related discipline,
MotivationLocating the k largest subsequences: Main ideasResults Problem definitions Problem instance ( k=5 ) Bibliography
ProblemResultsConcurrent Range Reporting Input: n points in d dimensional space. Support reporting the t points in a query box. The best previous result:
ProblemData StructuresLower Bound Preprocess a set of N 3-dimensional points into an I/O-efficient data structure, such that all points inside an axis.
Internal Memory Pointer MachineRandom Access MachineStatic Setting Data resides in records (nodes) that can be accessed via pointers (links). The priority.
SOA & Event Driven Architecture Steve Else, Ph.D., Certified Enterprise Architect, SOA COP Srinidhi Boray, Certified Enterprise Architect, Ingine, Inc.
Link Building and Communities in Large Networks Link Building Link Building is W[1]-Hard and allows no FPTAS The dashed links show the set of two new links.
Industry focused Education for the Tourism Industry Dr. Dominic Dillane Head of School of Hospitality Management and Tourism at DIT.
Brody Sandel Aarhus University IntroductionResults Objectives  Perform the first global, high-resolution analysis of controls on tree cover  Analyze.
(A Survey on) Priority Queues IanFest, University of Waterloo, Waterloo, Ontario, Canada, August 14-15, 2013 Gerth Stølting Brodal Aarhus Universty.
Sparse RecoveryAlgorithmResults  Original signal x = x k + u, where x k has k large coefficients and u is noise.  Acquire measurements Ax = y. If |x|=n,
GPU ProgrammingOther Relevant ObservationsExperiments GPU kernels run on C blocks (CTAs) of W warps. Each warp is a group of w=32 threads, which are executed.
What types of problems we study, Part 1: Statistical problemsHighlights of the theoretical results What types of problems we study, Part 2: ClusteringFuture.
Searching in Trees Gerth Stølting Brodal Aarhus University
Computer, Communication and Information Sciences
CHAPTER 7 TRAINING EMPLOYEES
What is the importance of Health and Safety Training Courses? By E.H.S Emirates Foundation.
משרד התעשייה, המסחר והתעסוקה פעולות המשרד לעידוד מגזר המיעוטים
Thesis Preparation Algorithms Gerth Stølting Brodal.
Concurrency Platforms OpenMP and Cilk Plus
Presentation transcript:

MADALGO ― Center for Massive Data Algorithmics MADALGO is a major new basic research center funded by The Danish National Research Foundation initially for a five year period. The main motivation behind the center is the rapid increasing availability of massive high-quality data, and the desire to be able to access and process this data on many diverse computing platforms. The main high-level objective of the center will be to significantly advance fundamental algorithmic knowledge in the massive data processing area. The center will cover all areas of the design, analysis and implementation of algorithms and data structures for processing massive data (interpreted broadly to cover computations where data is large compared to the computational resources), but initial focus will mainly be on three core research areas.  I/O-efficient algorithms  cache-oblivious algorithms  streaming algorithms The center will build on a strong international core research team, as well as the establishment of a vibrant international environment at the main center site at the University of Aarhus.

Core researchers Lars Arge PhD students Postdocs Allan Grønlund Jørgensen Mohammad Abam S. Srinivasa RaoUlrich Meyer (MPI Informatik) Henrik BlunckGerth Stølting Brodal Kurt Mehlhorn (MPI Informatik) Piotr Indyk (MIT) Erik Demaine (MIT) Gabriel MoruzMartin Olsen Anders Hesselund Jensen Johan Nilsson Thomas Mølhave Konstantinos Tsakalidis Lasse Kosetski Deleuran Management Else Magård Programmers Ellen Kjemtrup Lindstrøms Kasper Dalgaard Larsen