153 search results - page 24 / 31 » Computing Approximate Solutions of the Maximum Covering Prob... |
181
click to vote
NIPS
2007
15 years 6 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
195
click to vote
FOCS
2004
IEEE
15 years 9 months ago
2004
IEEE
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs (demands) s1t1, s2t2, . . ., sktk, the goal is to maximize the number ...
161
click to vote
PPSN
2010
Springer
15 years 3 months ago
2010
Springer
Abstract. In this paper, we elaborate how decision space diversity can be integrated into indicator-based multiobjective search. We introduce DIOP, the diversity integrating multio...
154
click to vote
ICDCN
2009
Springer
15 years 10 months ago
2009
Springer
Wireless sensor networks with multiple users collecting data directly from the sensors have many potential applications. An important problem is to allocate for each user a query r...
147
click to vote
ECCV
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...