Sciweavers

915 search results - page 65 / 183
» Maximally Abstract Retrenchments
Sort
View
GECON
2008
Springer
152views Business» more  GECON 2008»
13 years 9 months ago
The Power of Preemption in Economic Online Markets
Abstract. In distributed computer networks where resources are under decentralized control, selfish users will generally not work towards one common goal, such as maximizing the o...
Lior Amar, Ahuva Mu'alem, Jochen Stößer
CORR
2010
Springer
116views Education» more  CORR 2010»
13 years 8 months ago
Interference Alignment as a Rank Constrained Rank Minimization
Abstract--We show that the maximization of the sum degreesof-freedom for the static flat-fading multiple-input multipleoutput (MIMO) interference channel is equivalent to a rank co...
Dimitris S. Papailiopoulos, Alexandros G. Dimakis
CORR
2008
Springer
84views Education» more  CORR 2008»
13 years 8 months ago
Rate and Power Allocation in Fading Multiple Access Channels
Abstract-- We consider the problem of rate and power allocation in a fading multiple-access channel. Our objective is to obtain rate and power allocation policies that maximize a u...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
CORR
2007
Springer
154views Education» more  CORR 2007»
13 years 8 months ago
To Code or Not to Code Across Time: Space-Time Coding with Feedback
Abstract— Space-time codes leverage the availability of multiple antennas to enhance the reliability of communication over wireless channels. While space-time codes have initiall...
Che Lin, Vasanthan Raghavan, Venugopal V. Veeraval...
TCOM
2008
151views more  TCOM 2008»
13 years 8 months ago
Low complexity MIMO scheduling with channel decomposition using capacity upperbound
Abstract In multiuser MIMO systems, the base station schedules transmissions to a group of users simultaneously. Since the data transmitted to each user are different, in order to ...
Xiaojie Zhang, Jungwoo Lee