483 search results - page 49 / 97 » On perfectness of sums of graphs |
CVPR
2007
IEEE
14 years 10 months ago
2007
IEEE
Model learning and tracking are two important topics in computer vision. While there are many applications where one of them is used to support the other, there are currently only...
AAAI
1996
13 years 10 months ago
1996
GSAT is a randomized greedy local repair procedure that was introduced for solving propositional satis ability and constraint satisfaction problems. We present an improvement to G...
ROBOCUP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Coordination graphs offer a tractable framework for cooperative multiagent decision making by decomposing the global payoff function into a sum of local terms. Each age...
CPC
1998
13 years 8 months ago
1998
Given a sequence of non-negative real numbers 0 1 ::: which sum to 1, we consider a random graph having approximately in vertices of degree i. In 12] the authors essentially show ...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...