Research Topics of Potential Interest to Geography COMPUTER SCIENCE Research Away Day, 29 th April 2010 Thomas Erlebach.

Slides:

Advertisements

Similar presentations

Energy-Efficient Distributed Algorithms for Ad hoc Wireless Networks Gopal Pandurangan Department of Computer Science Purdue University.

Advertisements

Approximation algorithms for geometric intersection graphs.

Chapter 4 Partition I. Covering and Dominating.

Improvements and extras Paul Thomas CSIRO. Overview of the lectures 1.Introduction to information retrieval (IR) 2.Ranked retrieval 3.Probabilistic retrieval.

Minimum Vertex Cover in Rectangle Graphs

13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.

Nathan Wiebe, Ashish Kapoor and Krysta Svore Microsoft Research ASCR Workshop Washington DC Quantum Deep Learning.

Carolina Galleguillos, Brian McFee, Serge Belongie, Gert Lanckriet Computer Science and Engineering Department Electrical and Computer Engineering Department.

Support Vector Machines

Lesson Topic: Lesson 4 Creating a Histogram

CS774. Markov Random Field : Theory and Application Lecture 17 Kyomin Jung KAIST Nov

Proportion Priors for Image Sequence Segmentation Claudia Nieuwenhuis, etc. ICCV 2013 Oral.

1 Processing & Analysis of Geometric Shapes Shortest path problems Shortest path problems The discrete way © Alexander & Michael Bronstein, ©

Using Structure Indices for Efficient Approximation of Network Properties Matthew J. Rattigan, Marc Maier, and David Jensen University of Massachusetts.

INTRODUCTION COMPUTATIONAL MODELS. 2 What is Computer Science Sciences deal with building and studying models of real world objects /systems. What is.

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs Authors: T. Erlebach, L. Jansen, and E. Seidel Presented by: Ping Luo 10/17/2005.

CPSC 689: Discrete Algorithms for Mobile and Wireless Systems Spring 2009 Prof. Jennifer Welch.

- 1 - Intentional Mobility in Wireless Sensor Networks Deployment, Dispatch, and Applications Dr. You-Chiun Wang ( 王友群 ) Department of Computer Science,

Cache Placement in Sensor Networks Under Update Cost Constraint Bin Tang, Samir Das and Himanshu Gupta Department of Computer Science Stony Brook University.

Histograms, Frequency Distributions and Related Topics These are constructions that will allow us to represent large sets of data in ways that may be more.

Relevance Feedback based on Parameter Estimation of Target Distribution K. C. Sia and Irwin King Department of Computer Science & Engineering The Chinese.

CSE 6405 Graph Drawing Text Books T. Nishizeki and M. S. Rahman, Planar Graph Drawing, World Scientific, Singapore, G. Di Battista,

Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.

1 University of Denver Department of Mathematics Department of Computer Science.

Efficient Quantum State Tomography using the MERA in 1D critical system Presenter : Jong Yeon Lee (Undergraduate, Caltech)

Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.

Distance Indexing on Road Networks A summary Andrew Chiang CS 4440.

The Important Thing About Shapes Written by: K. Gooding.

1 DARPA TMR Program Collaborative Mobile Robots for High-Risk Urban Missions Second Quarterly IPR Meeting January 13, 1999 P. I.s: Leonidas J. Guibas and.

Decentralised Coordination of Mobile Sensors School of Electronics and Computer Science University of Southampton Ruben Stranders,

Extracting Places and Activities from GPS Traces Using Hierarchical Conditional Random Fields Yong-Joong Kim Dept. of Computer Science Yonsei.

Exploratory Data Analysis. Computing Science, University of Aberdeen2 Introduction Applying data mining (InfoVis as well) techniques requires gaining.

Exposure In Wireless Ad-Hoc Sensor Networks Seapahn Meguerdichian Computer Science Department University of California, Los Angeles Farinaz Koushanfar.

Term 2 Grade 11 Core Project The Polynomial Project Done by: Abdulla Mohammed Almuhiri & Mohammed Saeed Class :

Trust-Aware Optimal Crowdsourcing With Budget Constraint Xiangyang Liu 1, He He 2, and John S. Baras 1 1 Institute for Systems Research and Department.

RESOURCES, TRADE-OFFS, AND LIMITATIONS Group 5 8/27/2014.

On Graph Query Optimization in Large Networks Alice Leung ICS 624 4/14/2011.

A Tensorial Approach to Access Cognitive Workload related to Mental Arithmetic from EEG Functional Connectivity Estimates S.I. Dimitriadis, Yu Sun, K.

Copyright © Cengage Learning. All rights reserved The Area Problem.

CSCI 3160 Design and Analysis of Algorithms Chengyu Lin.

Easiest-to-Reach Neighbor Search Fatimah Aldubaisi.

G1.4.1: Solve problems involving area and perimeter of quadrilaterals.

11/25/2015 Wireless Sensor Networks COE 499 Localization Tarek Sheltami KFUPM CCSE COE 1.

Spectral Sequencing Based on Graph Distance Rong Liu, Hao Zhang, Oliver van Kaick {lrong, haoz, cs.sfu.ca {lrong, haoz, cs.sfu.ca.

Kansas State University Department of Computing and Information Sciences CIS 730: Introduction to Artificial Intelligence Lecture 9 of 42 Wednesday, 14.

1 Minimum Error Rate Training in Statistical Machine Translation Franz Josef Och Information Sciences Institute University of Southern California ACL 2003.

Chapter 4 Partition (1) Shifting Ding-Zhu Du. Disk Covering Given a set of n points in the Euclidean plane, find the minimum number of unit disks to cover.

MotivationKinetic Data StructuresExampleKDS Properties Networks play a central role in numerous applications, and the design of good networks is therefore.

1 Approximation algorithms Algorithms and Networks 2015/2016 Hans L. Bodlaender Johan M. M. van Rooij TexPoint fonts used in EMF. Read the TexPoint manual.

Efficient Point Coverage in Wireless Sensor Networks Jie Wang and Ning Zhong Department of Computer Science University of Massachusetts Journal of Combinatorial.

Definitions Square root: Perfect Square: Square of the Square Root Property: If A = s 2, then s is called a square root of A. Squares of whole numbers.

1 35 th International Colloquium on Automata, Languages and Programming July 8, 2008 Randomized Self-Assembly for Approximate Shapes Robert Schweller University.

TU/e Algorithms (2IL15) – Lecture 13 1 Wrap-up lecture.

The geometric GMST problem with grid clustering Presented by 楊劭文, 游岳齊, 吳郁君, 林信仲, 萬高維 Department of Computer Science and Information Engineering, National.

Welcome! Cinda Heeren Lecturer Department of CS UIUC The Beauty of Computer Science.

What does it mean to find the volume of a solid? For example:

Perimeter & Area. Today’s Objectives:  Learn what it means to find perimeter and area.  Practice finding or estimating the perimeter and area.

9.1 PERIMETER AND AREA OF PARALLELOGRAMS Objective: Students find the perimeter and area of parallelograms.

Deep Learning Overview Sources: workshop-tutorial-final.pdf

Xifeng Yan Philip S. Yu Jiawei Han SIGMOD 2005 Substructure Similarity Search in Graph Databases.

ME 521 Computer Aided Design 15-Optimization

Take the worksheet from the Chrombook cart.

The normal distribution

Bin Fu Department of Computer Science

Thesis Proposal Title Student Name Registration No. Supervisor Name

A Few Sample Reductions

Presentation transcript:

Research Topics of Potential Interest to Geography COMPUTER SCIENCE Research Away Day, 29 th April 2010 Thomas Erlebach

Department of Computer Science Main research topics Algorithms on graphs and networks Algorithms on geometric objects –Automatic map labelling –Geometric coverage problems Computing with uncertainty –Algorithms for efficient data gathering

Department of Computer Science Graphs and Networks Analyse properties of networks. Design algorithms to compute / count substructures in networks. Optimisation problems.

Department of Computer Science Geometric problems: Map Labelling

Department of Computer Science Leicester Point Feature, Sliding Label (horizontally sliding) (fully sliding)

Department of Computer Science Map Labelling with Sliding Labels Given: A set of weighted point features with rectangular, sliding labels Task: Label points of maximum total weight with non-overlapping labels

Department of Computer Science Approximation Result There is a polynomial-time approximation scheme for weighted map labelling with rectangular sliding labels of bounded height or length ratio.

Department of Computer Science Geometric Coverage Problems Example problem: Given a set of points and a set of geometric objects, determine a smallest set of objects that covers all points. Approximation algorithms for various shapes (squares, disks).

Department of Computer Science Computing with Uncertainty In many application settings, only estimates of data values are easily available. Exact data can be obtained by an update (query) at a certain cost. We study methods that minimise the update costs needed to compute the desired result.