| Document Date: 2003-11-02 23:40:04
Open Document File Size: 1,47 MBShare Result on Facebook
City Pixel / Seattle / Directly Index / / Company HP / / Country United States / / Currency USD / IDR / / / Facility Nearest Neighbor Search Hans-Peter Thomas Seidl University of Munich / Germany Institute / Kriegel University of Munich / / IndustryTerm k-nearest neighbor query processing / ma1 algorithm / query parameter previous algorithm / multi-step k-nearest neighbor algorithms / multi-step k-nearest neighbor algorithm / multi-step similarity search / query processing / medical imaging / database systems / improved multi-step k-nearest neighbor algorithm / incremental algorithms / database applications / optirral algorithm / latter solution / k-nearest neighbor search algorithms / similarity search / multi-step k-nearestneighbor algorithm / multi-step query processorfor k-nearestneighbor search / multi-step query processing environment / multistep query processing / multi-step algorithm / multistep algorithm / multi-step query processing strategy / bound algorithms / overall algorithm / k-nearest neighbor search / multi-step algorithms / multi-step query processing / nearest neighbor search / k-nearest neighbor algorithm / / OperatingSystem HP-UX / / Organization Germany Institute / University of Munich / / Person Hans-Peter Thomas / / / Position Prime Minister / / ProgrammingLanguage FL / / Technology 0 10 query parameter previous algorithm / k-nearest neighbor algorithm / multi-step k-nearest neighbor algorithm / previous algorithm / multi-step algorithms / k-nearest neighbor search algorithms / multistep algorithm / 3-D / multi-step algorithm / overall algorithm / multi-step k-nearestneighbor algorithm / multi-step k-nearest neighbor algorithms / ma1 algorithm / CAD/CAM / t- 1 / The algorithm / 2.1 Directly Index-Based Algorithms / 0.4 0.2 0 ALGORITHM / improved multi-step k-nearest neighbor algorithm / Previous multi-step algorithm / previous k-nearest neighbor algorithm / medical imaging / / URL http /
SocialTag |
Optimal Multi-Step k-Nearest Neighbor Search Hans-Peter Thomas Seidl University of Munich, Germany Institute for Computer Science