Back to Results
First PageMeta Content
Information retrieval / Numerical analysis / Discrete geometry / Machine learning / Nearest neighbor search / K-d tree / K-nearest neighbor algorithm / Information science / Mathematics / Search algorithms


Accounting for Boundary Effects in Nearest Neighbor Searching∗ Sunil Arya† David M. Mount‡
Add to Reading List

Document Date: 2006-04-04 05:14:01


Open Document

File Size: 232,58 KB

Share Result on Facebook

City

Cambridge / Kowloon / /

Company

ESPRIT / AT&T Bell Laboratories / /

Country

Germany / /

Event

Person Communication and Meetings / /

Facility

Hong Kong University of Science / College Park / University of Maryland / Harvard University / /

IndustryTerm

important applications / worst-case algorithms / nearest neighbor searching algorithms / k-d tree algorithm / k-d tree algorithms / binary search tree / simpler algorithm / nearest neighbor algorithms / /

Organization

Society of Fellows / Harvard University / National Science Foundation / Department of Computer Science / Institute for Advanced Computer Studies / Physics Department / Hong Kong University of Science and Technology / University of Maryland / College Park / MaxPlanck-Institut f¨ / /

Person

Murray Hill / /

Position

author / /

ProvinceOrState

New Jersey / Maryland / Massachusetts / /

Technology

nearest neighbor searching algorithms / nearest neighbor algorithms / k-d tree algorithm / much simpler algorithm / simulation / bucketing algorithm / worst-case algorithms / k-d tree algorithms / /

SocialTag