518 search results - page 63 / 104 » Beating a Random Assignment |
143
Voted
FLAIRS
2004
15 years 3 months ago
2004
A distributed search algorithm for solving distributed constraint satisfaction problems (DisCSPs) is presented. The proposed algorithm is composed of multiple search processes (SP...
130
click to vote
CORR
2008
Springer
15 years 2 months ago
2008
Springer
We present a deterministic way of assigning small (log bit) weights to the edges of a bipartite planar graph so that the minimum weight perfect matching becomes unique. The isolati...
143
Voted
IJCV
2006
15 years 2 months ago
2006
We present a novel framework for motion segmentation that combines the concepts of layer-based methods and feature-based motion estimation. We estimate the initial correspondences...
140
click to vote
BMVC
2010
15 years 17 days ago
2010
The problems of dense stereo reconstruction and object class segmentation can both be formulated as Conditional Random Field based labelling problems, in which every pixel in the ...
129
Voted
CORR
2011
Springer
14 years 9 months ago
2011
Springer
We consider a consensus algorithm in which every node in a time-varying undirected connected graph assigns equal weight to each of its neighbors. Under the assumption that the deg...