Biased Nearest Neighbour Search
Public Deposited- Resource Type
- Creator
- 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
- Language
- Publisher
- Thesis Degree Level
- Thesis Degree Name
- Thesis Degree Discipline
- Identifier
- Rights Notes
Copyright © 2015 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
- Date Created
- 2015
Relations
- In Collection:
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
minor-biasednearestneighboursearch.pdf | 2023-05-04 | Public | Download |