%0 Conference Paper %1 conf/dexa/NamnandorjCFO08 %A Namnandorj, Sansarkhuu %A Chen, Hanxiong %A Furuse, Kazutaka %A Ohbo, Nobuo %B DEXA %D 2008 %E Bhowmick, Sourav S. %E Küng, Josef %E Wagner, Roland R. %I Springer %K dblp %P 693-700 %T Efficient Bounds in Finding Aggregate Nearest Neighbors. %U http://dblp.uni-trier.de/db/conf/dexa/dexa2008.html#NamnandorjCFO08 %V 5181 %@ 978-3-540-85653-5

@inproceedings{conf/dexa/NamnandorjCFO08, added-at = {2017-05-26T00:00:00.000+0200}, author = {Namnandorj, Sansarkhuu and Chen, Hanxiong and Furuse, Kazutaka and Ohbo, Nobuo}, biburl = {https://www.bibsonomy.org/bibtex/276195037020c44af801d4befdd0ef9e2/dblp}, booktitle = {DEXA}, crossref = {conf/dexa/2008}, editor = {Bhowmick, Sourav S. and Küng, Josef and Wagner, Roland R.}, ee = {https://doi.org/10.1007/978-3-540-85654-2_60}, interhash = {205e9f3af895e1667750763fd7f0ba28}, intrahash = {76195037020c44af801d4befdd0ef9e2}, isbn = {978-3-540-85653-5}, keywords = {dblp}, pages = {693-700}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2019-05-15T17:28:04.000+0200}, title = {Efficient Bounds in Finding Aggregate Nearest Neighbors.}, url = {http://dblp.uni-trier.de/db/conf/dexa/dexa2008.html#NamnandorjCFO08}, volume = 5181, year = 2008 }