1 / 16

Where Do We Go From Here ?

Design and Analysis Algorithm Lionov – December 02, 2010. Where Do We Go From Here ?. Data Structure. Suffix Tree Kd -Tree R-Tree van Emde Boas Tree Binomial Heap Fibonacci Heap. Kd -Tree. R-Tree. Graph. Flow Network Graph Drawing Clique Hamiltonian Cycle Vertex Coloring

ron
Télécharger la présentation

Where Do We Go From Here ?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Design and Analysis Algorithm Lionov – December 02, 2010 Where Do We Go From Here ?

  2. Data Structure • Suffix Tree • Kd-Tree • R-Tree • van Emde Boas Tree • Binomial Heap • Fibonacci Heap

  3. Kd-Tree

  4. R-Tree

  5. Graph • Flow Network • Graph Drawing • Clique • Hamiltonian Cycle • Vertex Coloring • Steiner Tree

  6. Flow Network • Flow Network : • a directed graph (network) where each edge has a capacity and receives a flow (and sometimes they have a cost) • Problem description: • What is the maximum flow (with minimum cost) from one node to another, while respecting the capacity constraint of each edge • Problem example: • finding the most-effective way to ship goods between a set of factories and a set of factories • resource allocation in communications networks • traffic in a road system

  7. Graph Drawing • A drawing of a graph …. Nicely • Sample application: • ER-Diagram • Class diagram • Organization Chart

  8. Other Topics in Computer Science • Evolutionary Algorithm • Compression • Multimedia Retrieval • Parallel Computation • Computer Vision • Path Planning • Crowd Simulation • Geographic Data Processing • Artificial Intelligence

  9. Multimedia Retrieval • Searching in large collections of images, video, sound, 3D scenes • Sound : http://www.tuneteller.com/ , http://pierement.zoo.cs.uu.nl/muugle/

  10. Parallel Computation - 1 • Computation which many calculations are carried out simultaneously • Hardware: • Multi-Core or Multi-Processor • Distributed : Cluster & Grid • Software: • Parallel Programming Libraries: MPI

  11. Parallel Computation - 2 • Applications • Design of airfoils • Bioinformatics (analyzing biological sequence for new drugs) • Astronomy – The Sloan Digital Sky Survey • Wall Streets • Computer Security – intrusion detection

  12. Parallel Computation – 3 • Example: • Cannon’s Algorithm for Matrix Multiplication • Quicksort • Single Source Shortest Path: Dijkstra’s Alg. • Depth First Search • Fast Fourier Transform

  13. Computer Vision • Slide from Robby Tan • http://people.cs.uu.nl/robby/fog/index.html

  14. Path Planning • Slide from Roland Geraerts

  15. Crowd Simulation • Example: HiDAC (High-Density Autonomous Crowd)

  16. Artificial Intelligence…in games • Pogamut • Pogamututilizes UnrealScript (UT2004 scripting language) and also NetBeans Java platform to provide an out-of-the box development environment for AI of virtual characters. • The main objective was to simplify the "physical" part of agent creation. Most actions in the environment (even the complicated ones, like pathfinding and gathering information in agent's memory) can be performed by one or two commands. This enables user to concentrate his efforts on the interesting parts.

More Related