%0 Journal Article %1 journals/tcs/NandyDG03 %A Nandy, Subhas C. %A Das, Sandip %A Goswami, Partha P. %D 2003 %J Theor. Comput. Sci. %K dblp %N 1-3 %P 273-288 %T An efficient k nearest neighbors searching algorithm for a query line. %U http://dblp.uni-trier.de/db/journals/tcs/tcs299.html#NandyDG03 %V 299

@article{journals/tcs/NandyDG03, added-at = {2017-05-28T00:00:00.000+0200}, author = {Nandy, Subhas C. and Das, Sandip and Goswami, Partha P.}, biburl = {https://www.bibsonomy.org/bibtex/2d6dbf5e8ff9518a68c7f22832a515012/dblp}, ee = {https://doi.org/10.1016/S0304-3975(02)00322-5}, interhash = {e021ba5aaa249e75db1b1cdaa93dcea3}, intrahash = {d6dbf5e8ff9518a68c7f22832a515012}, journal = {Theor. Comput. Sci.}, keywords = {dblp}, number = {1-3}, pages = {273-288}, timestamp = {2017-05-31T23:59:55.000+0200}, title = {An efficient k nearest neighbors searching algorithm for a query line.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs299.html#NandyDG03}, volume = 299, year = 2003 }