5624 search results - page 155 / 1125 » On Conditional Covering Problem |
169
click to vote
SIAMCO
2000
15 years 6 months ago
2000
We study a class of functional which can be used for matching objects which can be represented as mappings from a fixed interval, I, to some "feature space." This class o...
126
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
Recent information hiding schemes are scrutinized in terms of their cryptographic performance. We establish conditions under which the key equivocation function is optimal for the...
175
click to vote
COMBINATORICA
2008
15 years 6 months ago
2008
The rigidity of squares of graphs in three-space has important applications to the study of flexibility in molecules. The Molecular Conjecture, posed in 1984 by T-S. Tay and W. Wh...
158
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, ....
174
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...