270 search results - page 32 / 54 » Partitioning into Sets of Bounded Cardinality |
SIGECOM
2008
ACM
13 years 8 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
ADHOC
2007
13 years 9 months ago
2007
We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the ma...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
STOC
2009
ACM
14 years 9 months ago
2009
ACM
We prove that for any positive integer k, there is a constant ck such that a randomly selected set of cknk log n Boolean vectors with high probability supports a balanced k-wise i...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
We investigate the bit-search type irregular decimation algorithms that are used within LFSR-based stream ciphers. In particular, we concentrate on BSG and ABSG, and consider two ...