MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "A Generalization of Binary Search." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

15 documents found, showing 1 through 10. Next 10 →

ATOM

In-memory URL Compression
by Kasom Koht-Arsa Department
… searched using a general binary search algorithm, and can be accessed randomly with an index. The access…
Add To MetaCart

The ubiquitous B-tree
by Douglas Comer — 1979 — ACM Computing Surveys
… algorithms as a generalization of the binary search tree in which more than two paths leave a given node…
Cited by 451 (0 self) – Add To MetaCart

Kato: A Program Slicing Tool for Declarative Specifications
by unknown authors
… on the size relation. Search specifies the ordering property of a general binary search tree regarding…
Add To MetaCart

A Survey of Algorithms and Data Structures for Range Searching
by Jon Louis Bentley, Jerome H. Friedman — 1979 — ACM Computing Surveys
… in k-space. The k-d tree is a generalization of the binary search tree used for sorting and searching…
Cited by 2 (1 self) – Add To MetaCart

Analysis of a greedy active learning strategy
by Sanjoy Dasgupta — 2004 — In Advances in Neural Information Processing Systems
… hypothesis classes H, is a sort of a generalized binary search possible? What would the search space look…
Cited by 24 (2 self) – Add To MetaCart

Algorithms for Fast Vector Quantization
by Sunil Arya, David M. Mount — 1993 — Proc. of DCC '93: Data Compression Conference
… Bentley introduced the k-d tree as a generalization of the binary search tree in higher dimensions [4…
Cited by 45 (11 self) – Add To MetaCart

Accounting for Boundary Effects in Nearest Neighbor Searching
by Sunil Arya, David M. Mount, Onuttom Narayan — 1995
… the k-d tree as a generalization of the binary search tree in high dimensions. Each internal node…
Cited by 32 (4 self) – Add To MetaCart

6D SLAM with Approximate Data Association
by Andreas Nüchter, Kai Lingemann, Joachim Hertzberg, Hartmut Surmann — 2005 — In Proc. of the 12th Int. Conference on Advanced Robotics (ICAR
… shows two slices taken from a kd-tree. 1) kd-trees: kD-trees are a generalization of binary search trees…
Cited by 10 (1 self) – Add To MetaCart

Data Structures for Spatial Database Systems
by Octavian Procopiuc — 1997
…, the idea can be applied to an arbitrary dimension d. The quadtree is a generalization of the binary search…
Cited by 1 (0 self) – Add To MetaCart

3D Mapping with Semantic Knowledge
by Andreas Nüchter, Oliver Wulf, Kai Lingemann, Joachim Hertzberg, Bernado Wagner, Hartmut Surmann — 2005 — In RoboCup International Symposium
… generalization of binary search trees. Every node represents a partition of a point set to the two successor…
Cited by 7 (2 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB