An efficient k nearest neighbours searching algorithm for a query line

Simple item page
dc.contributor.authorNandy, Subhas C
dc.contributor.authorDas, Sandip
dc.contributor.authorGoswami, Partha P
dc.date.accessioned2014-01-08T10:36:13Z
dc.date.available2014-01-08T10:36:13Z
dc.date.issued2003
dc.identifier.citationTheoretical Computer Science, v 299, p 273-288en_US
dc.identifier.urihttp://hdl.handle.net/10263/5749
dc.language.isoenen_US
dc.subjectNearest and furthest neighboursen_US
dc.subjectQuery lineen_US
dc.subjectArrangementen_US
dc.subjectDualityen_US
dc.titleAn efficient k nearest neighbours searching algorithm for a query lineen_US
dc.typeArticleen_US

Files

Original bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
An efficient k nearest neibours searching-TCS-299-2003- p 273-288.pdf
Size:
657.34 KB
Format:
Adobe Portable Document Format
Download

License bundle

Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Computer Science