1376 search results - page 17 / 276 » Searching Trees: An Essay |
102
click to vote
SIGMOD
2010
ACM
14 years 4 months ago
2010
ACM
In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous computing power by integrating multiple cores, each with wide vect...
77
Voted
PKDD
2000
Springer
15 years 1 months ago
2000
Springer
A new approach to the induction of multivariate decision trees is proposed. A linear decision function (hyper-plane) is used at each non-terminal node of a binary tree for splittin...
FSTTCS
2004
Springer
15 years 2 months ago
2004
Springer
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
144
click to vote
ICAART
2010
INSTICC
15 years 6 months ago
2010
INSTICC
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
85
Voted
FLAIRS
2006
14 years 11 months ago
2006
Decision Trees are well known for their training efficiency and their interpretable knowledge representation. They apply a greedy search and a divide-and-conquer approach to learn...