Nearest neighbour queries on commercial databases

When you are in need of cash now, how can you quickly find the two nearest ATMs around you that are within one km? This can also be thought of as a k-nearest neighbour (KNN) problem. To help solving the problem, the objective of the project is to develop an application that allows users to search fo...

全面介紹

Saved in:
書目詳細資料
主要作者: Lin, Xinzhen.
其他作者: School of Computer Engineering
格式: Final Year Project
語言:English
出版: 2012
主題:
在線閱讀:http://hdl.handle.net/10356/48694
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!