3422 search results - page 125 / 685 » Random Subset Optimization |
122
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We consider the problem of minimizing the size of a set system G such that every subset of {1, . . . , n} can be written as a disjoint union of at most k members of G, where k and...
JCT
2006
15 years 4 months ago
2006
For z1, z2, z3 Zn, the tristance d3(z1, z2, z3) is a generalization of the L1-distance on Zn to a quantity that reflects the relative dispersion of three points rather than two. ...
147
Voted
ASIACRYPT
2008
Springer
15 years 6 months ago
2008
Springer
Every public-key encryption scheme has to incorporate a certain amount of randomness into its ciphertexts to provide semantic security against chosen ciphertext attacks (IND-CCA). ...
120
click to vote
IJSN
2007
15 years 4 months ago
2007
: Most Internet worms use random scanning. The distribution of vulnerable hosts on the Internet, however, is highly non-uniform over the IP-address space. This implies that random ...
130
click to vote
GLOBECOM
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— For a multiple-input single-output (MISO) downlink channel with ¢ transmit antennas, it has been recently proved that zero-forcing beamforming (ZFBF) to a subset of (a...