4894 search results - page 498 / 979 » The Guarding Problem - Complexity and Approximation |
163
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
160
click to vote
MIA
2010
14 years 11 months ago
2010
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
153
Voted
ICRA
2006
IEEE
15 years 11 months ago
2006
IEEE
— We address the problem of placing a sensor network so as to minimize the uncertainty in estimating the position of targets. The novelty of our formulation is in the sensing mod...
149
Voted
WACV
2005
IEEE
15 years 10 months ago
2005
IEEE
— In this work, we present a formalization of the video synchronization problem that exposes new variants of the problem that have been left unexplored to date. We also present a...
137
click to vote
ASPDAC
1999
ACM
15 years 9 months ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...