1640 search results - page 26 / 328 » Conditional Independence Trees |
ICML
2010
IEEE
13 years 11 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in graphical models requires that we maximize the sum of two terms: a data-dependent term, encoding the conditional likelihood of a certain la...
EJC
2010
13 years 10 months ago
2010
We consider the number of nodes in the levels of unlabelled rooted random trees and show that the stochastic process given by the properly scaled level sizes weakly converges to th...
ICML
1997
IEEE
14 years 10 months ago
1997
IEEE
Heuristic measures for estimating the quality of attributes mostly assume the independence of attributes so in domains with strong dependencies between attributes their performanc...
ALGORITHMICA
1999
13 years 9 months ago
1999
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
COMBINATORICS
2006
13 years 10 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...