Date and time:
Venue: 10.08.04
Chair: Xiaodong Li
Abstract:
K-d tree data structure has been used to index multi-dimensional instances, and this data structure helps faster nearest neighbour search for a given instance. Recently, we have employed k-d tree to locate the nearest neighbours as part of our method to estimate the execution time of a task on a grid node. In this talk, I will present simple techniques that improve the performance of nearest neighbour search in k-d tree.
About the speaker:
Panu Phinjaroenphan
is currently a PhD student with the
Seminar Organisation
Seminars are free and open to the general public. No booking is necessary. If you are interested in giving a presentation in this seminar series, or to make suggestions for speakers, please contact Xiaodong Li, the seminar co-ordinator.