195 search results - page 23 / 39 » A polynomial algorithm for the p-centdian problem on a tree |
STOC
2006
ACM
14 years 8 months ago
2006
ACM
One of the major tasks of evolutionary biology is the reconstruction of phylogenetic trees from molecular data. The evolutionary model is given by a Markov chain on the true evolu...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we study the complexity of the model-checking problem for the tree logic introduced as the basis for the query language TQL [Cardelli and Ghelli, 2001]. We define tw...
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
Regular games provide a very useful model for the synthesis of controllers in reactive systems. The complexity of these games depends on the representation of the winning condition...
ALGORITHMICA
1998
13 years 7 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...