| Document Date: 2005-07-10 17:51:22
Open Document File Size: 761,96 KBShare Result on Facebook
Currency pence / USD / GBP / / / Facility Columbia University / / IndustryTerm search performance / k-dimensional binary search tree / structured and unstructured search problems / search point / software implementation / proposed high dimensional search algorithm / binary search / closest point search / projection search paradigm / few elegant solutions / 1D binary search / k-d tree algorithm / real-time object recognition / closed form solution / software equivalent / exhaustive search algorithms / multidimensional search problems / search techniques / 2D search space / projection search / Metric space search techniques / hardware search engine / search space / exhaustive search / search algorithm / basic algorithm / search execution time / nearest neighbor search / search problems / search algorithms / / OperatingSystem L3 / / Organization Department of Computer Science / OP PQ / Columbia University / New York / IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE / / Position Prime Minister / representative / / ProvinceOrState New York / / PublishedMedium IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE / / Technology randomized algorithm / exhaustive search algorithms / MPEG / proposed algorithm / existing search algorithms / search algorithm / search algorithms / Randomized algorithms / proposed high dimensional search algorithm / 2 PREVIOUS WORK Search algorithms / search engine / k-d tree algorithm / 3G / basic algorithm / /
SocialTag |
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 19, NO. 9, SEPTEMBER[removed]A Simple Algorithm for Nearest Neighbor Search in High Dimensions