Sciweavers

Share
3 search results - page 1 / 1
» Balanced Randomized Tree Splitting with Applications to Evol...
Sort
View
STACS
1999
Springer
12 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on eļ¬ƒcient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
CCECE
2006
IEEE
12 years 11 months ago
New Constraints on Generation of Uniform Random Samples from Evolutionary Trees
In this paper, we introduce new algorithms for selecting taxon samples from large evolutionary trees, maintaining uniformity and randomness, under certain new constraints on the t...
Anupam Bhattacharjee, Zalia Shams, Kazi Zakia Sult...
PODC
2004
ACM
12 years 11 months ago
Balanced binary trees for ID management and load balance in distributed hash tables
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
Gurmeet Singh Manku
books