%0 Conference Paper %1 conf/icfhr/ZhangS02 %A Zhang, Bin %A Srihari, Sargur N. %B IWFHR %D 2002 %I IEEE Computer Society %K dblp %P 13-18 %T A fast algorithm for finding k-nearest neighbors with non-metric dissimilarity. %U http://dblp.uni-trier.de/db/conf/icfhr/iwfhr2002.html#ZhangS02 %@ 0-7695-1692-0

@inproceedings{conf/icfhr/ZhangS02, added-at = {2023-03-24T00:00:00.000+0100}, author = {Zhang, Bin and Srihari, Sargur N.}, biburl = {https://www.bibsonomy.org/bibtex/2349f23491d8374deb133104acdd0f32c/dblp}, booktitle = {IWFHR}, crossref = {conf/icfhr/2002}, ee = {https://doi.ieeecomputersociety.org/10.1109/IWFHR.2002.1030877}, interhash = {cc525c2740343361b55114a6a7e588fe}, intrahash = {349f23491d8374deb133104acdd0f32c}, isbn = {0-7695-1692-0}, keywords = {dblp}, pages = {13-18}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T05:49:27.000+0200}, title = {A fast algorithm for finding k-nearest neighbors with non-metric dissimilarity.}, url = {http://dblp.uni-trier.de/db/conf/icfhr/iwfhr2002.html#ZhangS02}, year = 2002 }