87 search results - page 7 / 18 » Dynamic Maximum Tree Depth |
RECOMB
2005
Springer
14 years 10 months ago
2005
Springer
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
INFOCOM
2008
IEEE
14 years 4 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...
COMCOM
2000
13 years 9 months ago
2000
The new Path Length Control (PLC) algorithm establishes and maintains multicast trees which maximize the bandwidth to be shared by multiple receivers and which satisfy the maximum...
NETWORKING
2004
13 years 11 months ago
2004
Subset Difference Revocation (SDR) [8] has been proposed to perform group rekeying in a stateless manner. However, statelessness comes at a cost in terms of storage and message ove...
DCC
2006
IEEE
14 years 3 months ago
2006
IEEE
A new approach of backward coding of wavelet trees (BCWT) is presented. Contrary to the common “forward” coding of wavelet trees from the highest level (lowest resolution), th...