29
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: not found
      • Article: not found

      A New Class of Upper Bounds on the Log Partition Function

      , ,
      IEEE Transactions on Information Theory
      Institute of Electrical and Electronics Engineers (IEEE)

      Read this article at

      ScienceOpenPublisher
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          Related collections

          Most cited references14

          • Record: found
          • Abstract: not found
          • Article: not found

          Factor graphs and the sum-product algorithm

            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            Approximating discrete probability distributions with dependence trees

              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms

                Bookmark

                Author and article information

                Journal
                IEEE Transactions on Information Theory
                IEEE Trans. Inform. Theory
                Institute of Electrical and Electronics Engineers (IEEE)
                0018-9448
                July 2005
                July 2005
                : 51
                : 7
                : 2313-2335
                Article
                10.1109/TIT.2005.850091
                c1a5357b-fe3e-485b-bfd3-e472b2350e9b
                © 2005
                History

                Comments

                Comment on this article