dc.contributor.author | Nandy, Subhas C | |
dc.contributor.author | Das, Sandip | |
dc.contributor.author | Goswami, Partha P | |
dc.date.accessioned | 2014-01-08T10:36:13Z | |
dc.date.available | 2014-01-08T10:36:13Z | |
dc.date.issued | 2003 | |
dc.identifier.citation | Theoretical Computer Science, v 299, p 273-288 | en_US |
dc.identifier.uri | http://hdl.handle.net/10263/5749 | |
dc.language.iso | en | en_US |
dc.subject | Nearest and furthest neighbours | en_US |
dc.subject | Query line | en_US |
dc.subject | Arrangement | en_US |
dc.subject | Duality | en_US |
dc.title | An efficient k nearest neighbours searching algorithm for a query line | en_US |
dc.type | Article | en_US |