![]() ![]() ![]() | ![]() |
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Note: Links lead to the DBLP on the Web. Florian Krebs 2 Stefan Berchtold , Christian Böhm , Daniel A. Keim , Florian Krebs, Hans-Peter Kriegel : On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces. ICDT 2001 : 435-449 1 Christian Böhm , Bernhard Braunmüller , Florian Krebs, Hans-Peter Kriegel : Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data. SIGMOD Conference 2001 ![]() DiSC'02 © 2003 Association for Computing Machinery |