1272 search results - page 79 / 255 » The Set Cover with Pairs Problem |
110
Voted
SIAMCOMP
1998
15 years 14 days ago
1998
A chain of a set P of n points in the plane is a chain of the dominance order on P. A k-chain is a subset C of P that can be covered by k chains. A k-chain C is a maximum k-chain ...
95
Voted
SDM
2009
SIAM
15 years 10 months ago
2009
SIAM
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
154
click to vote
SIGECOM
2011
ACM
14 years 3 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
118
click to vote
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
Many information integration tasks require computing similarity between pairs of objects. Pairwise similarity computations are particularly important in record linkage systems, as...
101
Voted
TWC
2010
14 years 7 months ago
2010
We consider a multiuser two-way relay network where multiple pairs of users exchange information with the assistance of a relay node, using orthogonal channels per pair. For a vari...