Sciweavers

10 search results - page 1 / 2
» Lower Bounds For Multidimensional Zero Sums
Sort
View
COMBINATORICA
2004
50views more  COMBINATORICA 2004»
13 years 7 months ago
Lower Bounds For Multidimensional Zero Sums
Christian Elsholtz
ICML
2003
IEEE
14 years 8 months ago
BL-WoLF: A Framework For Loss-Bounded Learnability In Zero-Sum Games
We present BL-WoLF, a framework for learnability in repeated zero-sum games where the cost of learning is measured by the losses the learning agent accrues (rather than the number...
Vincent Conitzer, Tuomas Sandholm
DAGSTUHL
2007
13 years 9 months ago
Diagonal Circuit Identity Testing and Lower Bounds
In this paper we give the first deterministic polynomial time algorithm for testing whether a diagonal depth-3 circuit C(x1, . . . , xn) (i.e. C is a sum of powers of linear funct...
Nitin Saxena
ICASSP
2011
IEEE
12 years 11 months ago
On the sum rate of ZF detectors over correlated K fading MIMO channels
This paper presents a detailed sum rate investigation of Zero-Forcing (ZF) detectors over composite multiple-input multiple-output (MIMO) channels. To this end, we consider the ge...
Michail Matthaiou, Nestor D. Chatzidiamantis, Geor...
TSP
2008
119views more  TSP 2008»
13 years 7 months ago
MIMO Relaying With Linear Processing for Multiuser Transmission in Fixed Relay Networks
In this paper, a novel relaying strategy that uses multiple input multiple output (MIMO) fixed relays with linear processing to support multiuser transmission in cellular networks...
Chan-Byoung Chae, Taiwen Tang, Robert W. Heath Jr....