2354 search results - page 213 / 471 » Assignment Problems |
206
click to vote
JMLR
2012
13 years 8 months ago
2012
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
161
click to vote
SIAMDM
2002
15 years 6 months ago
2002
We present a new class of randomized approximation algorithms for unrelated parallel machine scheduling problems with the average weighted completion time objective. The key idea i...
264
click to vote
GIS
2007
ACM
16 years 7 months ago
2007
ACM
We propose a general framework to index very large datasets of spatial data in a distributed system. Our proposal is built on the recently proposed Scalable Distributed Rtree (SD-...
192
click to vote
BMVC
2010
15 years 4 months 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 ...
179
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we propose a novel framework for fast multilevel routing considering crosstalk and performance optimization. To handle the crosstalk minimization problem, we incorp...