Definition: In this task, you are given a part of an article. Your task is to generate headline (title) for this text. Preferred headlines are under fifteen words.
Input: It was recently shown that the problem of de­<lb>coding messages transmitted through a noisy<lb>channel can be formulated as a belief up­<lb>dating task over a probabilistic network (14).<lb>Moreover, it was observed that iterative ap­<lb>plication of the (linear time) belief propa­<lb>gation algorithm designed for polytrees (15)<lb>outperformed state of the art decoding algo­<lb>rithms, even though the corresponding net­<lb>works may have many cycles.<lb>This paper demonstrates empirically that<lb>an approximation algorithm approx-mpe<lb>for solving the most probable explana­<lb>tion<lb>(MPE) problem, developed within the<lb>recently proposed mini-bucket elimination<lb>framework (4), outperforms iterative belief<lb>propagation on classes of coding networks<lb>that have bounded induced width.<lb>Our ex­<lb>periments suggest that approximate MPE de­<lb>coders can be good competitors to the ap­<lb>proximate belief updating decoders.

Empirical Evaluation of Approximation Algorithms for Probabilistic Decoding