16404 search results - page 794 / 3281 » A set coverage problem |
161
click to vote
ESA
2009
Springer
16 years 2 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...
176
click to vote
LPNMR
2009
Springer
16 years 2 months ago
2009
Springer
Problems arising from the revision of propositional knowledge bases have been intensively studied for two decades. Many different approaches to revision have thus been suggested, w...
189
click to vote
ICRA
2008
IEEE
16 years 1 months ago
2008
IEEE
— This paper addresses problems of inferring the locations of moving agents from combinatorial data extracted by robots that carry sensors. The agents move unpredictably and may ...
202
click to vote
IPPS
2008
IEEE
16 years 1 months ago
2008
IEEE
Emerging configurable infrastructures (large-scale overlays, grids, distributed testbeds, and sensor networks among others) comprise diverse sets of computing resources and netwo...
283
click to vote
MMSP
2008
IEEE
16 years 1 months ago
2008
IEEE
—This paper addresses the problem of dense disparity estimation from a pair of color stereo images. Based on a convex set theoretic formulation, the stereo matching problem is ca...