4894 search results - page 527 / 979 » The Guarding Problem - Complexity and Approximation |
184
click to vote
COMGEO
2012
ACM
14 years 17 days ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
150
click to vote
CVPR
2005
IEEE
16 years 6 months ago
2005
IEEE
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the ...
145
click to vote
ECCV
2004
Springer
16 years 6 months ago
2004
Springer
When we take a picture through transparent glass the image we obtain is often a linear superposition of two images: the image of the scene beyond the glass plus the image of the sc...
150
click to vote
ICIP
2006
IEEE
16 years 6 months ago
2006
IEEE
Dimensionality reduction, spectral classification and segmentation are the three main problems in hyperspectral image analysis. In this paper we propose a Bayesian estimation appr...
155
click to vote
CP
2009
Springer
15 years 11 months ago
2009
Springer
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...