1099 search results - page 89 / 220 » On the Complexity of Computing Evolutionary Trees |
113
click to vote
ACNS
2003
Springer
15 years 1 months ago
2003
Springer
Secure and reliable group communication is an increasingly active research area by growing popularity in group-oriented and collaborative application. One of the important challeng...
PDCAT
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
160
click to vote
POPL
2008
ACM
15 years 10 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
112
click to vote
ICIP
2005
IEEE
15 years 11 months ago
2005
IEEE
This paper introduces the Interlevel Product (ILP) which is a transform based upon the Dual-Tree Complex Wavelet. Coefficients of the ILP have complex values whose magnitudes indi...
MFCS
2004
Springer
15 years 3 months ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...