2899 search results - page 5 / 580 » Dynamic Trees in Practice |
SPAA
2006
ACM
14 years 1 months ago
2006
ACM
Tree contraction algorithms, whose idea was first proposed by Miller and Reif, are important parallel algorithms to implement efficient parallel programs manipulating trees. Desp...
VLDB
2005
ACM
14 years 7 months ago
2005
ACM
ACL
1998
13 years 9 months ago
1998
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...
AINA
2006
IEEE
14 years 1 months ago
2006
IEEE
Efficient service discovery in dynamic, crossorganizational VO is one of the challenge aspects in ChinaGrid. Network overlay and search algorithms are two important considerations...
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...