1923 search results - page 108 / 385 » Weighted Decision Trees |
194
click to vote
RP
2009
Springer
16 years 25 days ago
2009
Springer
Dynamic networks of Pushdown Systems (PDN in short) have been introduced to perform static analysis of concurrent programs that may spawn threads dynamically. In this model the se...
137
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We analyze skewing, an approach that has been empirically observed to enable greedy decision tree learners to learn "difficult" Boolean functions, such as parity, in the...
179
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
We consider the parametric minimum spanning tree problem, in which we are given a graph with edge weights that are linear functions of a parameter and wish to compute the sequenc...
142
click to vote
ACL
2006
15 years 7 months ago
2006
This paper describes an ongoing effort to parse the Hebrew Bible. The parser consults the bracketing information extracted from the cantillation marks of the Masoetic text. We fir...
165
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
— We consider the decentralized binary hypothesis testing problem on trees of bounded degree and increasing depth. For a regular tree of depth t and branching factor k ≥ 2, we ...