16404 search results - page 831 / 3281 » A set coverage problem |
213
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
295
click to vote
PODC
2011
ACM
14 years 10 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
302
click to vote
CVPR
2012
IEEE
13 years 10 months ago
2012
IEEE
Label fusion strategies are used in multi-atlas image segmentation approaches to compute a consensus segmentation of an image, given a set of candidate segmentations produced by r...
186
click to vote
ICIP
2004
IEEE
16 years 9 months ago
2004
IEEE
The task of segmenting cell nuclei in microscope images is a classical image analysis problem. The accurate nuclei segmentation may contribute to development of successful system ...
222
click to vote
ICPR
2006
IEEE
16 years 8 months ago
2006
IEEE
General dissimilarity-based learning approaches have been proposed for dissimilarity data sets [11, 10]. They arise in problems in which direct comparisons of objects are made, e....