Journal article
Random Hyperplane Search Trees.
- Abstract:
-
A hyperplane search tree is a binary tree used to store a set S of n d-dimensional data points. In a random hyperplane search tree for S, the root represents a hyperplane defined by d data points drawn uniformly at random from S. The remaining data points are split by the hyperplane, and the definition is used recursively on each subset. We assume that the data are points in general position in Rd. We show that, uniformly over all such data sets S, the expected height of the hyperplane tree i...
Expand abstract
- Publication status:
- Published
Actions
Access Document
- Publisher copy:
- 10.1137/060678609
Why is the content I wish to access not available via ORA?
Bibliographic data (the information relating to research outputs) and full-text items (e.g. articles, theses, reports, etc.) arrive in ORA from several different sources. Unfortunately we are not able to make available the full-text for every research output.
Please contact the ORA team (
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
) if you have queries regarding unavailable content OR if you are aware of a full-text copy we can make available.
Content may be unavailable for the following four reasons
-
Version unsuitable
-
We have not obtained a suitable full-text for a given research output. See this page for more information.
-
Recently completed
-
Sometimes content is held in ORA but is unavailable for a fixed period of time to comply with the policies and wishes of rights holders.
-
Permissions
-
All content made available in ORA should comply with relevant rights, such as copyright. See this page for more information.
-
Clearance
-
Some thesis volumes scanned as part of the digitisation scheme funded by Dr Leonard Polonsky are currently unavailable due to sensitive material or uncleared third-party copyright content. We are attempting to contact authors whose theses are affected.
Alternative access to the full-text
You may be able to access the full-text directly from the publisher's website using the 'Publisher Copy' link in the 'Links & Downloads' box from a research output's ORA record page. This method may require an institutional or individual subscription to the journal/resource.
Authors
Bibliographic Details
- Journal:
- SIAM J. Comput.
- Volume:
- 38
- Issue:
- 6
- Pages:
- 2411-2425
- Publication date:
- 2009-01-01
- DOI:
- EISSN:
-
1095-7111
- ISSN:
-
0097-5397
- Source identifiers:
-
102284
Item Description
- Language:
- English
- Keywords:
- Pubs id:
-
pubs:102284
- UUID:
-
uuid:84d36457-1e66-4506-8ebd-20d9de511464
- Local pid:
- pubs:102284
- Deposit date:
- 2012-12-19
Terms of use
- Copyright date:
- 2009
If you are the owner of this record, you can report an update to it here: Report update to this record