Sciweavers

1503 search results - page 36 / 301
» Self-optimizing distributed trees
Sort
View
ICPADS
2002
IEEE
15 years 7 months ago
A Scalable Core Migration Protocol for Dynamic Multicast Tree
Ting-Yuan Wang, Lih-Chyau Wuu, Shing-Tsaan Huang
114
Voted
SPAA
1998
ACM
15 years 6 months ago
Communication-Optimal Parallel Minimum Spanning Tree Algorithms (Extended Abstract)
Micah Adler, Wolfgang Dittrich, Ben H. H. Juurlink...
PODC
2010
ACM
15 years 2 months ago
Non-blocking binary search trees
Faith Ellen, Panagiota Fatourou, Eric Ruppert, Fra...
136
Voted
AUTONOMICS
2008
ACM
15 years 4 months ago
Building multicast trees in ad-hoc networks
Multicast trees are used in a variety of applications, such as publish/subscribe systems or content distribution networks. Existing algorithms for ad-hoc networks typically produc...
Raphaël Kummer, Peter G. Kropf, Pascal Felber
ECML
2005
Springer
15 years 8 months ago
A Comparison of Approaches for Learning Probability Trees
Probability trees (or Probability Estimation Trees, PET’s) are decision trees with probability distributions in the leaves. Several alternative approaches for learning probabilit...
Daan Fierens, Jan Ramon, Hendrik Blockeel, Maurice...