2354 search results - page 90 / 471 » Radio number for trees |
157
click to vote
CCCG
2010
15 years 7 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...
144
click to vote
TCBB
2008
15 years 6 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...
157
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
Consider laying out a fixed-topology tree of N nodes into external memory with block size B so as to minimize the worst-case number of block memory transfers required to traverse ...
178
click to vote
DAM
1998
15 years 6 months ago
1998
We give a simple and natural proof of (an extension of) the identity P(k, l, n) = P2(k − 1, l − 1, n − 1). The number P(k, l, n) counts noncrossing partitions of {1, 2, . . ...
178
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, the task of selecting the optimal subset of pronunciation variants from a set of automatically generated candidates is recast as a tree search problem. In this appr...