Computing the local consensus of trees
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
WABI '01 Proceedings of the First International Workshop on Algorithms in Bioinformatics
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Balanced randomized tree splitting with applications to evolutionary tree constructions
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
An efficient reduction from constrained to unconstrained maximum agreement subtree
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
An O(nlog n)-time algorithm for the maximum constrained agreement subtree problem for binary trees
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
Fundamenta Informaticae - Computing Patterns in Strings
Sentence fusion for multidocument news summarization
Computational Linguistics
Hi-index | 0.00 |
This paper considers the problems of admission control and virtual circuit routing in high performance computing and communication systems. Admission control and virtual circuit routing problems arise in numerous applications, including video-servers, ...