1. DSpace at Indian Statistical Institute
  2. Scientific Contributions of ISI
  3. Computer Science
Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5749
Full metadata record
DC FieldValueLanguage
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
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
An efficient k nearest neibours searching-TCS-299-2003- p 273-288.pdf657.34 kBAdobe PDFView/Open
Show simple item record


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.