Back to Results
First PageMeta Content
Artificial intelligence / K-d tree / K-nearest neighbor algorithm / Hash function / Hash table / Best bin first / Search engine indexing / Geometric hashing / Database index / Information science / Search algorithms / Information retrieval


Shape Indexing Using Approximate Nearest-Neighbour Search in High-Dimensional Spaces Jeffrey S. Beis and David G. Lowe
Add to Reading List

Document Date: 1997-07-29 19:05:04

Open Document

File Size: 134,95 KB

Share Result on Facebook

City

Introduction Shape / /

/

Facility

Computer Science University of British Columbia Vancouver / /

IndustryTerm

then processing time / long linear search / priority k-d tree search / approximate algorithm / k-d tree search algorithm / short search time / k-d tree search / hash table search / search hypersphere / nearest-neighbour search times / search algorithm / inefficient search / search time / particular algorithm / /

Organization

High-Dimensional Spaces Jeffrey S. Beis and David G. Lowe Department / University of British Columbia / Computer Science University / /

Person

David G. Lowe / /

Technology

approximate algorithm / BBF search algorithm / k-d tree search algorithm / BBF algorithm / one particular algorithm / /

SocialTag