Biased Nearest Neighbour Search

It appears your Web browser is not configured to display PDF files. Download adobe Acrobat or click here to download the PDF file.

Click here to download the PDF file.

Creator: 

Minor, Daniel Lewis

Date: 

2015

Abstract: 

The nearest neighbour search problem is to preprocess a set of points so that for any query point, the closest point in the set to that query point can be determined quickly. In the biased version of this problem a probability distribution over the search points is available that can be used to answer searches more efficiently on average. This thesis contains empirical results showing that practical implementations of data structures for the biased nearest neighbour search problem are possible.

Subject: 

Computer Science

Language: 

English

Publisher: 

Carleton University

Thesis Degree Name: 

Master of Computer Science: 
M.C.S.

Thesis Degree Level: 

Master's

Thesis Degree Discipline: 

Computer Science

Parent Collection: 

Theses and Dissertations

Items in CURVE are protected by copyright, with all rights reserved, unless otherwise indicated. They are made available with permission from the author(s).