232
click to vote
AAAI
2011
14 years 7 months ago
2011
We consider the problem of modeling network interactions and identifying latent groups of network nodes. This problem is challenging due to the facts i) that the network nodes are...
241
click to vote
AAAI
2011
14 years 7 months ago
2011
Coarse-to-fine approaches use sequences of increasingly fine approximations to control the complexity of inference and learning. These techniques are often used in NLP and visio...
227
click to vote
AAAI
2011
14 years 7 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
215
click to vote
AAAI
2011
14 years 7 months ago
2011
We present a dual decomposition approach to the treereweighted belief propagation objective. Each tree in the tree-reweighted bound yields one subproblem, which can be solved with...