Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"Complex Cliques"”.

  1. Lossless Coding of Markov Random Fields with Complex Cliques

    … cases of the BP algorithm: MRFs with only simple cliques, and MRFs with complex cliques. In the latter case, we study a minimum radius condition requirement for ensuring that all cliques are accounted for during coding. This condition also simplifies the process of conditioning on observed sites. …

    queens Repository record for Lossless Coding of Markov Random Fields with Complex Cliques (opens in a new tab)