Back to Results
First PageMeta Content
Statistical theory / Information theory / Point location / Entropy / K-d tree / Decision tree model / FO / Bin / Logarithm / Theoretical computer science / Mathematics / Applied mathematics


Efficient Expected-Case Algorithms for Planar Point Location Sunil Arya1 , Siu-Wing Cheng⋆1 , David M. Mount⋆⋆2 , and H. Ramesh3 1 Department of Computer Science, The Hong Kong University of Science and
Add to Reading List

Document Date: 2006-04-04 10:58:25


Open Document

File Size: 169,39 KB

Share Result on Facebook

City

Bern / /

Company

Goodrich / /

/

Facility

We store / Indian Institute of Science / University of Maryland / The Hong Kong University of Science / College Park / /

IndustryTerm

quadratic space solution / fundamental search problems / weighted search tree takes / binary search tree / optimum binary search tree / query algorithm / weighted search tree / search algorithms / onedimensional search problem / persistent search tree method / /

NaturalFeature

Clear Water Bay / /

Organization

Hong Kong University of Science and Technology / University of Maryland / College Park / National Science Foundation / Department of Computer Science / Institute for Advanced Computer Studies / Indian Institute of Science / Bangalore / Department of Computer Science and Automation / /

Person

Siu-Wing Cheng / David M. Mount / /

Technology

query algorithm / search algorithms / two algorithms / /

SocialTag