1798 search results - page 33 / 360 » A Tree for All Seasons |
DAM
2007
13 years 7 months ago
2007
We study the following problem: Given a tree G and a finite set of trees H, find a subset O of the edges of G such that G − O does not contain a subtree isomorphic to a tree f...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
AML
2011
12 years 11 months ago
2011
We show that the consistency of the theory “ZF + DC + Every successor cardinal is regular + Every limit cardinal is singular + Every successor cardinal satisfies the tree prope...