16430 search results - page 45 / 3286 » On Computable Tree Functions |
ALT
1995
Springer
13 years 11 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
— In this paper, we revisit the problem of multicast tree construction in overlay peer-to-peer networks. We present an iterative online multicast tree construction algorithm for ...
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
JCT
2008
13 years 7 months ago
2008
Let T be an unrooted tree. The chromatic symmetric function XT , introduced by Stanley, is a sum of monomial symmetric functions corresponding to proper colorings of T . The subtre...
ICML
2005
IEEE
14 years 8 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...