Learn More
Myopathy has been found to develop spontaneously in 100% of SJL/J mice between 6 and 8 months of age. Extent of muscular involvement and mouse strength were quantified in SJL/J mice and Balb/c control mice 2-16 months old. Muscle from young SJL/J mice exhibited histopathological abnormalities and occasional inflammatory infiltrate. By 6 months, 78% of SJL/J(More)
SJL mice spontaneously develop B cell lymphomas (historically described as reticulum cell sarcomas) by 12 months of age and inflammatory muscle disease (myositis) by 6 months of age. Tumors originate in mesenteric lymph nodes and in Peyer's patches and resemble human germinal center lymphomas. The growth of reticulum cell sarcomas is completely dependent on(More)
Chord sequences are a compact and useful description of music, representing each beat or measure in terms of a likely distribution over individual notes without specifying the notes exactly. Transcribing music audio into chord sequences is essential for harmonic analysis, and would be an important component in content-based retrieval and indexing, but(More)
When belief propagation (BP) converges, it does so to a stationary point of the Bethe free energy F , and is often strikingly accurate. However , it may converge only to a local optimum or may not converge at all. An algorithm was recently introduced by Weller and Jebara for attractive binary pairwise MRFs which is guaranteed to return an-approximation to(More)
Belief propagation is a remarkably effective tool for inference, even when applied to networks with cycles. It may be viewed as a way to seek the minimum of the Bethe free energy, though with no convergence guarantee in general. A variational perspective shows that, compared to exact inference, this minimization employs two forms of approximation: (i) the(More)
Finding the most likely (MAP) configuration of a Markov random field (MRF) is NP-hard in general. A promising, recent technique is to reduce the problem to finding a maximum weight stable set (MWSS) on a derived weighted graph, which if perfect, allows inference in polynomial time. We derive new results for this approach, including a general decomposition(More)