2492 search results - page 144 / 499 » On the General Signature Trees |
170
click to vote
JSAC
2006
15 years 6 months ago
2006
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
208
click to vote
BMCBI
2004
15 years 6 months ago
2004
Background: In population-based studies, it is generally recognized that single nucleotide polymorphism (SNP) markers are not independent. Rather, they are carried by haplotypes, ...
130
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Buhrman, Cleve and Wigderson gave a general communication protocol for block-composed functions f(g1(x1 , y1 ), · · · , gn(xn , yn )) by simulating a decision tree com...
172
click to vote
DLT
2003
15 years 7 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
154
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
The Revised6 Report on Scheme requires its generic equivalence predicate, equal?, to terminate even on cyclic inputs. While the terminating equal? can be implemented via a DFA-equ...