Pages that link to "Item:Q4513214"
From MaRDI portal
The following pages link to Decision Trees for Geometric Models (Q4513214):
Displaying 13 items.
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- A note on data structures for maintaining bipartitions (Q924550) (← links)
- Queries revisited. (Q1426146) (← links)
- Decision trees for function evaluation: simultaneous optimization of worst and expected cost (Q1679228) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On the hardness of the minimum height decision tree problem (Q1885823) (← links)
- Almost optimal set covers in finite VC-dimension (Q1906049) (← links)
- Approximating optimal binary decision trees (Q2428690) (← links)
- Exact Learning of Discretized Geometric Concepts (Q4210170) (← links)
- On Polynomial Time Constructions of Minimum Height Decision Tree (Q5091026) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
- Partial order multiway search (Q6535268) (← links)
