596 search results - page 107 / 120 » Factorial Markov Random Fields |
NAACL
2010
14 years 9 months ago
2010
Extraction of entities from ad creatives is an important problem that can benefit many computational advertising tasks. Supervised and semi-supervised solutions rely on labeled da...
ACL
2009
14 years 9 months ago
2009
In this paper, we analyze the impact of different automatic annotation methods on the performance of supervised approaches to the complex question answering problem (defined in th...
ICASSP
2009
IEEE
14 years 9 months ago
2009
IEEE
Belief propagation is a popular global optimization technique for many computer vision problems. However, it requires extensive computation due to the iterative message passing op...
110
click to vote
ICDM
2009
IEEE
14 years 9 months ago
2009
IEEE
In this paper we propose the multirelational topic model (MRTM) for multiple types of link modeling such as citation and coauthor links in document networks. In the citation networ...
110
click to vote
CVPR
2010
IEEE
15 years 8 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in Markov Random Fields (MRFs) is an NP-hard problem, and thus research has focussed on either finding efficiently solvable subclasses (e.g. t...