Sciweavers

1089 search results - page 87 / 218
» Bounds on generalized Frobenius numbers
Sort
View
TIT
2011
98views more  TIT 2011»
13 years 4 months ago
Information Rates for Multiantenna Systems With Unknown Fading
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
Krishnan Padmanabhan, Sundeep Venkatraman, Oliver ...
CORR
2011
Springer
207views Education» more  CORR 2011»
13 years 3 months ago
The AllDifferent Constraint with Precedences
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
SIROCCO
2003
13 years 10 months ago
The Cost of Concurrent, Low-Contention Read-Modify-Write
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
Costas Busch, Marios Mavronicolas, Paul G. Spiraki...
PODC
2010
ACM
13 years 9 months ago
Brief announcement: swarming secrets
We present information-theoretically secure schemes for sharing and modifying secrets among a dynamic swarm of computing devices. The schemes support an unlimited number of change...
Shlomi Dolev, Juan A. Garay, Niv Gilboa, Vladimir ...
MST
2011
184views Hardware» more  MST 2011»
13 years 4 months ago
Stackelberg Strategies and Collusion in Network Games with Splittable Flow
We study the impact of collusion in network games with splittable flow and focus on the well established price of anarchy as a measure of this impact. We first investigate symmet...
Tobias Harks