Please use this identifier to cite or link to this item: http://hdl.handle.net/10263/5288
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBandyopadhyay, Sanghamitra-
dc.contributor.authorMaulik, Ujjwal-
dc.date.accessioned2013-02-28T11:58:20Z-
dc.date.available2013-02-28T11:58:20Z-
dc.date.issued2002-
dc.identifier.citationPattern Recognition , v. 35, p. 2791-2799en_US
dc.identifier.urihttp://hdl.handle.net/10263/5288-
dc.language.isoenen_US
dc.subjectEfficient prototype reorderingen_US
dc.subjectNearest neighbor classificationen_US
dc.titleEfficient prototype reordering in nearest neighbor classificationen_US
dc.typeArticleen_US
Appears in Collections:Computer Science

Files in This Item:
File Description SizeFormat 
PR-35-2002-P2791-2799.pdf1.59 MBAdobe PDFView/Open


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