2899 search results - page 1 / 580 » Dynamic Trees in Practice |
WEA
2007
Springer
13 years 10 months ago
2007
Springer
Dynamic tree data structures maintain forests that change over time through edge insertions and deletions. Besides maintaining connectivity information in logarithmic time, they ca...
ICDM
2005
IEEE
13 years 10 months ago
2005
IEEE
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
CATA
2004
13 years 6 months ago
2004
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
CP
2006
Springer
13 years 8 months ago
2006
Springer
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining fi...