Retreat Sandbjerg, November 19-20, 2007. Homework Session 16:30 Homework handout 16:40 Homework 19:00 Dinner 21:00 Homework presentations.

Slides:

Advertisements

Similar presentations

Master Thesis Algorithms. Algorithms – Who? Faculty Lars Arge Gerth Stølting Brodal Gudmund Skovbjerg Frandsen Kristoffer Arnsfelt Hansen Peter Bro Miltersen.

Advertisements

Kandidatorientering, April 20, 2012 Algorithms and Data Structures.

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.

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

Kandidatorientering, October 28, 2011 Algorithms and Data Structures.

0 Course Outline n Introduction and Algorithm Analysis (Ch. 2) n Hash Tables: dictionary data structure (Ch. 5) n Heaps: priority queue data structures.

Tree Searching. Tree searches A tree search starts at the root and explores nodes from there, looking for a goal node (a node that satisfies certain conditions,

Hierarchy-conscious Data Structures for String Analysis Carlo Fantozzi PhD Student (XVI ciclo) Bioinformatics Course - June 25, 2002.

I/O-Algorithms Lars Arge January 31, Lars Arge I/O-algorithms 2 Random Access Machine Model Standard theoretical model of computation: –Infinite.

I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, Ke Yi Duke University University of Aarhus.

CSE332: Data Abstractions Lecture 9: B Trees Dan Grossman Spring 2010.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2009 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Th. 9/3/2009.

I/O-Algorithms Lars Arge Spring 2009 February 2, 2009.

I/O-Algorithms Lars Arge Spring 2009 January 27, 2009.

I/O-Algorithms Lars Arge Spring 2007 January 30, 2007.

I/O-Algorithms Lars Arge Aarhus University February 16, 2006.

Overview CS113, Fall 2000 Gene Itkis. The Promise Heavy Fast-paced Challenging Rewarding.

I/O-Algorithms Lars Arge Aarhus University February 7, 2005.

I/O-Algorithms Lars Arge Spring 2006 February 2, 2006.

Lars Arge1, Mark de Berg2, Herman Haverkort3 and Ke Yi1

I/O-Algorithms Lars Arge Aarhus University March 5, 2008.

I/O-Algorithms Lars Arge Aarhus University March 9, 2006.

Comparison Based Dictionaries: Fault Tolerance versus I/O Efficiency Gerth Stølting Brodal Allan Grønlund Jørgensen Thomas Mølhave University of Aarhus.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 1 Introduction/Overview Wed. 9/5/01.

I/O-Algorithms Lars Arge University of Aarhus March 7, 2005.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2005 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 9/7/05.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2000 Final Review Wed. 12/13.

Data Structures, Spring 2004 © L. Joskowicz 1 DAST – Final Lecture Summary and overview What we have learned. Why it is important. What next.

I/O-Algorithms Lars Arge Spring 2008 January 31, 2008.

Search  Exhaustive/Blind Search Methods Depth First Search Breadth First Search  Heuristic Methods Hill Climbing Beam Search Best First Search…

TerraStream: From Elevation Data to Watershed Hierarchies Thursday, 08 November 2007 Andrew Danner (Swarthmore), T. Moelhave (Aarhus), K. Yi (HKUST), P.

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Spring, 2002 Lecture 1 Introduction/Overview Text: Chapters 1, 2 Thurs.

I/O-Algorithms Lars Arge Fall 2014 August 28, 2014.

Heavily based on slides by Lars Arge I/O-Algorithms Thomas Mølhave Spring 2012 February 9, 2012.

Tree Searching Breadth First Search Dept First Search.

B-trees and kd-trees Piotr Indyk (slides partially by Lars Arge from Duke U)

Bin Yao Spring 2014 (Slides were made available by Feifei Li) Advanced Topics in Data Management.

MotivationFundamental ProblemsProblems on Graphs Parallel processors are becoming common place. Each core of a multi-core processor consists of a CPU and.

INTRODUCTION. What is an algorithm? What is a Problem?

Lecture 2: External Memory Indexing Structures CS6931 Database Seminar.

Nearest Neighbor Queries Chris Buzzerd, Dave Boerner, and Kevin Stewart.

I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, Ke Yi Duke University University of Aarhus.

CSE 326 Killer Bee-Trees David Kaplan Dept of Computer Science & Engineering Autumn 2001 Where was that root?

1 BIM304: Algorithm Design Time: Friday 9-12am Location: B4 Instructor: Cuneyt Akinlar Grading –2 Midterms – 20% and 30% respectively –Final – 30% –Projects.

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.

Depth First Search Maedeh Mehravaran Big data 1394.

Equivalence Between Priority Queues and Sorting in External Memory

ProblemAssumption and PreliminariesAlgorithm  How does the water flow and depressions fill during non-uniform rain over a terrain?  Can we efficiently.

15-853: Algorithms in the Real World Locality II: Cache-oblivious algorithms – Matrix multiplication – Distribution sort – Static searching.

Breadth First Search and Depth First Search. Greatest problem in Computer Science Has lead to a lot of new ideas and data structures Search engines before.

COMP 5704 Project Presentation Parallel Buffer Trees and Searching Cory Fraser School of Computer Science Carleton University, Ottawa, Canada

B-Trees Katherine Gurdziel 252a-ba. Outline What are b-trees? How does the algorithm work? –Insertion –Deletion Complexity What are b-trees used for?

Internal Memory Pointer MachineRandom Access MachineStatic Setting Data resides in records (nodes) that can be accessed via pointers (links). The priority.

Source: David Lee Matuszek

Memory Hierarchies [FLPR12] Matteo Frigo, Charles E. Leiserson, Harald Prokop, Sridhar Ramachandran. Cache- Oblivious Algorithms. ACM Transactions on Algorithms,

Graphs. What is a graph? In simple words, A graph is a set of vertices and edges which connect them. A node (or vertex) is a discrete position in the.

Collins Type I What assumption(s) do you make about a population’s growth when you make predictions by using an exponential expression?

1 i206: Lecture 17: Exam 2 Prep ; Intro to Regular Expressions Marti Hearst Spring 2012.

Lecture 1 Introduction/Overview Text: Chapters 1, 2 Wed. 1/28/04

CS302 Data Structures Fall 2012.

Advanced Topics in Data Management

Artificial Intelligence

Search Related Algorithms

Thesis Preparation Algorithms Gerth Stølting Brodal.

Spanning Tree Algorithms

CSE 417: Algorithms and Computational Complexity

Lecture 11 Graph Algorithms

Presentation transcript:

Retreat Sandbjerg, November 19-20, 2007

Homework Session 16:30 Homework handout 16:40 Homework 19:00 Dinner 21:00 Homework presentations

Did you bring? +

Illustrate Computer Science Concepts

Tree

Rooted Tree

Stack

16: :00Group work (3-4 people) Each group prepares illustrations for - 3 concepts handed out - ≥ 7 fsreely selected concepts One or more pictures per concept 21:00 - ?Presentation = Quiz 2 points per concept presented Creativity bonus: +1 point Web penalty: ÷1 point 1 point for correct guess Rules

Groups Group 1 Allan Grønlund Jørgensen Thomas Dueholm Hansen Srinivasa Rao Group 2 Anders Hessellund Jensen Morten Revsbæk Kevin Chang Brad Nickerson Group 3 Lasse Deleuran Andreas Beckmann Henrik Blunck Group 4 Konstantinos Tsakalidis Kasper Dalgaard Larsen Deepak Ajwani Group 5 Martin Olsen Mark Greve Gabriel Moruz Oren Weimann

Queue Bootstrapping I/O MADALGO Cache oblivious Branch prediction Streaming Tall cache assumption Point location van Emde Boas layout Running time Disk block Recursion Root to leaf path Search tree Computational geometry Triangulation Minimum spanning tree Algorithm Lower bound Terabyte Geographic Information System (GIS) Terrain B-tree O((N/B)log M/B (N/B)) Randomized algorithm Grid Distributed computing Logarithmic method Exponential growth Hierarchical memory Algorithm engineering Nearest neighbors problem Range searching Depth first search (DFS) Priority queue Suffix tree Shortest path TPIE (Transparent Parallel I/O Environment) Topological sorting