Sciweavers

1174 search results - page 7 / 235
» Functional Trees
Sort
View
JCT
2008
86views more  JCT 2008»
13 years 8 months ago
On distinguishing trees by their chromatic symmetric functions
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...
Jeremy L. Martin, Matthew Morin, Jennifer D. Wagne...
ICDM
2006
IEEE
151views Data Mining» more  ICDM 2006»
14 years 2 months ago
Decision Trees for Functional Variables
Classification problems with functionally structured input variables arise naturally in many applications. In a clinical domain, for example, input variables could include a time...
Suhrid Balakrishnan, David Madigan
CP
2005
Springer
14 years 2 months ago
Tree Decomposition with Function Filtering
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
Martí Sánchez, Javier Larrosa, Pedro...
ACMSE
2006
ACM
14 years 2 months ago
Framework design using function generalization: a binary tree traversal case study
A software framework is a technology that enables software reuse, potentially yielding rich dividends but requiring significant longterm investment. However, a framework is not a ...
H. Conrad Cunningham, Yi Liu, Pallavi Tadepalli
COCO
1991
Springer
112views Algorithms» more  COCO 1991»
14 years 3 days ago
Randomized vs.Deterministic Decision Tree Complexity for Read-Once Boolean Functions
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
Rafi Heiman, Avi Wigderson