1480 search results - page 199 / 296 » Distributed algorithms for weighted problems in sparse graph... |
97
Voted
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
In this paper, we formulate the shape localization problem in the Bayesian framework. In the learning stage, we propose the Constrained RankBoost approach to model the likelihood ...
118
click to vote
AAAI
2008
15 years 3 months ago
2008
Cooperative problem solving with resource constraints are important in practical multi-agent systems. Resource constraints are necessary to handle practical problems including dis...
175
Voted
MFCS
2010
Springer
14 years 11 months ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...
120
Voted
CIKM
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
114
click to vote
ECCV
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...