Netherlands : PhD student Efficient Data Structures for Trajectory Data

The Algorithms group, headed by prof. Mark de Berg, focuses on algorithms and data structures for spatial data. The group performs fundamental research in computational geometry, I/O-efficient algorithms, and graph drawing, with applications to, for instance, geographic information systems and automated cartography. Currently the group consists of Mark de Berg, Kevin Buchin, Maike Buchin, Herman Haverkort, Bettina Speckmann, and several PhD students, making it one of the largest groups world-wide in this area. For more information on the group, see:http://www.win.tue.nl/algo/

Project description:The availability of devices that can be used for tracking objects has increased tremendously over the past years, leading to an explosive growth of data recording the trajectories of objects. To make effective use of these data, efficient algorithms and data structures are needed. Most research to date focuses on efficient algorithms for analyzing trajectories: computing the similarity between two given trajectories, clustering a set of trajectories, finding motion patterns, and so on. This project considers the data-structuring aspects: how can we preprocess and store a large collection of trajectories such that certain queries on the collection can be answered efficiently. The focus will be on similarity queries: report (or count) the (sub)trajectories in the collection that are similar to a given query trajectory. The goal of the project is to develop solutions that work well in practice and whose performance is supported by a theoretical analysis of their speed and accuracy under reasonable assumptions on the input data. The project will thus have a theoretical component as well as an experimental component.

The project will take place in the Algorithms Group at the TU Eindhoven, under the supervision of prof. Mark de Berg.

As a PhD student your tasks concern the following activities:

• Perform scientific research in the described domain;
• Present results in international conferences;
• Publish results in scientific journals;
• Participate in activities of the group and the department;
• Assist staff in teaching undergraduate and graduate courses in the domain of the group (at most 20% of the time)

Requirements:We are looking for talented, enthusiastic PhD candidates who meet the following requirements:

• An MSc. degree in Computer Science or Mathematics, with a firm background in algorithms.
• Have an interest in theoretical algorithms research and in experimental algorithms research.
• Creative, proactive team player with good analytical skills;
• Good communicative skills in English, both written and oral.

Appointment and salary:
We offer:

• A full-time temporary appointment for a period of 4 years, with an intermediate evaluation after 9 months;
• A gross salary of € 2,042 per month in the first year increasing up to € 2,612 per month in the fourth year;
• Support for your personal development and career planning including courses, summer schools, conference visits etc.;
• A research position in a young, enthusiastic and internationally renowned research group.
• A broad package of fringe benefits (e.g. excellent technical infrastructure, child daycare, savings schemes and excellent sport facilities).

Further Information

Application Deadline : 31 May 2012