1923 search results - page 181 / 385 » Weighted Decision Trees |
224
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
149
click to vote
CISIS
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper proposes a fast AND/OR tree search algorithm using a multiple-paths concurrent search method. Conventional heuristic AND/OR tree search algorithms expand nodes in only ...
163
click to vote
TKDE
1998
15 years 6 months ago
1998
—Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets...
198
click to vote
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
177
click to vote
NAR
2006
15 years 6 months ago
2006
Variable order Markov models and variable order Bayesian trees have been proposed for the recognition of transcription factor binding sites, and it could be demonstrated that they...