Back to Results
First PageMeta Content
Discrete geometry / Search algorithms / Quadtree / Nearest neighbor search / Voronoi diagram / Information science / Mathematics / Geometry


Space-Time Tradeoffs for Approximate Spherical Range Counting Sunil Arya∗ Theocharis Malamatos† David M. Mount‡
Add to Reading List

Document Date: 2006-04-07 01:03:41

Open Document

File Size: 210,11 KB

Share Result on Facebook

City

Berlin / New York / Kowloon / /

Company

BP / Cambridge University Press / Annual ACM Sympos / /

Country

Germany / China / /

/

Facility

store S / College Park / store F / University of Maryland / The Hong Kong University of Science / /

IndustryTerm

query processing / leaf manufacturing / search path / binary search / coordinate systems / admissible solution / final search / computing / approximate range search / approximation algorithms / /

NaturalFeature

Arya mountain / D. M. mountain / Clear Water Bay / D. M. Mount / Malamatos mountain / T. mountain / S. mountain / T. Malamatos mountain / S. Arya mountain / /

Organization

Cambridge University / Max-Planck-Institut f¨ / National Science Foundation / Department of Computer Science / Institute for Advanced Computer Studies / Hong Kong University of Science and Technology / Research Grants Council / University of Maryland / College Park / /

Person

N. Netanyahu / /

Position

representative / /

ProvinceOrState

Maryland / New York / /

Technology

pursuing approximation algorithms / /

SocialTag