Please use this identifier to cite or link to this item:
http://hdl.handle.net/10263/5749| Title: | An efficient k nearest neighbours searching algorithm for a query line |
| Authors: | Nandy, Subhas C Das, Sandip Goswami, Partha P |
| Keywords: | Nearest and furthest neighbours Query line Arrangement Duality |
| Issue Date: | 2003 |
| Citation: | Theoretical Computer Science, v 299, p 273-288 |
| URI: | http://hdl.handle.net/10263/5749 |
| Appears in Collections: | Computer Science |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| An efficient k nearest neibours searching-TCS-299-2003- p 273-288.pdf | 657.34 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.