4137 search results - page 69 / 828 » On the number of matchings of a tree |
ECML
2005
Springer
15 years 7 months ago
2005
Springer
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
140
click to vote
ICPP
2003
IEEE
15 years 7 months ago
2003
IEEE
This paper presents a distributed algorithm called LREMiT for extending the lifetime of a source-based multicast tree in wireless ad hoc networks (WANET). The lifetime of a multic...
118
click to vote
ICN
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. Core-based multicast trees use less router state, but have significant drawbacks when compared to shortest-path trees, namely higher delay and poor fault tolerance. We e...
AUSDM
2006
Springer
15 years 5 months ago
2006
Springer
When different subsamples of the same data set are used to induce classification trees, the structure of the built classifiers is very different. The stability of the structure of ...
119
click to vote
EOR
2006
15 years 1 months ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...