3190 search results - page 137 / 638 » cans 2011 |
189
Voted
SIAMCOMP
2011
14 years 3 months ago
2011
We consider the Minimum Linear Arrangement problem and the (Uniform) Sparsest Cut problem. So far, these two notorious NP-hard graph problems have resisted all attempts to prove in...
106
click to vote
ICCV
2011
IEEE
14 years 25 days ago
2011
IEEE
In this paper, we propose a physically-based dynamical model for tracking. Our model relies on Newton’s second law of motion, which governs any real-world dynamical system. As a...
115
Voted
ICCV
2011
IEEE
14 years 24 days ago
2011
IEEE
Acquiring transparent, refractive objects is challenging as these kinds of objects can only be observed by analyzing the distortion of reference background patterns. We present a ...
113
click to vote
AAAI
2011
14 years 24 days ago
2011
Automated feature discovery is a fundamental problem in machine learning. Although classical feature discovery methods do not guarantee optimal solutions in general, it has been r...
131
click to vote
AAAI
2011
14 years 24 days 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...