599 search results - page 34 / 120 » The repeater tree construction problem |
73
Voted
BMCBI
2007
14 years 9 months ago
2007
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...
ACNS
2010
Springer
15 years 1 months ago
2010
Springer
Verifiably encrypted signature schemes (VES) allow a signer to encrypt his or her signature under the public key of a trusted third party, while maintaining public signature verifi...
87
Voted
NIPS
2001
14 years 11 months ago
2001
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association...
77
Voted
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
The construction of covering arrays with the fewest rows remains a challenging problem. Most computational and recursive constructions result in extensive repetition of coverage. W...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...