72 search results - page 10 / 15 » On the Complements of Partial k-Trees |
85
Voted
AAAI
2006
14 years 11 months ago
2006
The MAP (maximum a posteriori hypothesis) problem in Bayesian networks is to find the most likely states of a set of variables given partial evidence on the complement of that set...
100
click to vote
SOFTVIS
2010
ACM
14 years 9 months ago
2010
ACM
Developers must often diagnose anomalies in programs they only have a partial knowledge of. As a result, they must simultaneously reverse engineer parts of the system they are unf...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Spectral clustering is one of the most widely used techniques for extracting the underlying global structure of a data set. Compressed sensing and matrix completion have emerged a...
JSAC
2006
14 years 9 months ago
2006
We present a detailed study of the potential impact of BGP peering session attacks and the resulting exploitation of Route Flap Damping (RFD) that cause network-wide routing disrup...
TASLP
2002
14 years 9 months ago
2002
Two approaches are proposed for the design of tied-mixture hidden Markov models (TMHMM). One approach improves parameter sharing via partial tying of TMHMM states. To facilitate ty...