CORR
2010
Springer
13 years 6 months ago
2010
Springer
Finding approximate Nash equilibria in n × n bimatrix games is currently one of the main open problems in algorithmic game theory. Motivated in part by the lack of progress on wo...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
— Optimal partitioned cyclic difference packings (PCDPs) are shown to give rise to optimal frequency-hopping sequences and optimal comma-free codes. New constructions for PCDPs, ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
— We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
: We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization. For ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
—Signal-to-leakage-and-noise ratio (SLNR) is a promising criterion for linear precoder design in multi-user (MU) multiple-input multiple-output (MIMO) systems. It decouples the p...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
—We present a generalized sampling theorem allowing reconstructions in arbitrary bases. The classical Shannon Sampling Theorem is a special case of our theorem. Specifically, we...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
Abstract— We investigate secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources which are independent o...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
CORR
2010
Springer
13 years 6 months ago
2010
Springer
