1977 search results - page 112 / 396 » The satisfactory partition problem |
180
click to vote
ICIP
2009
IEEE
15 years 4 months ago
2009
IEEE
Due to the presence of speckle, segmentation of SAR images is generally acknowledged as a difficult problem. A large effort has been done in order to cope with the influence of sp...
131
click to vote
CDC
2010
IEEE
15 years 1 months ago
2010
IEEE
We consider Voronoi-like partitions for a team of moving targets distributed in the plane, such that each set in this partition is uniquely associated with a particular moving targ...
154
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
146
click to vote
SC
1994
ACM
15 years 10 months ago
1994
ACM
In adaptive irregular problems the data arrays are accessed via indirection arrays, and data access patterns change during computation. Implementingsuch problems ondistributed mem...
169
click to vote
NETWORKS
2006
15 years 6 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...