Sciweavers

915 search results - page 156 / 183
» Maximally Abstract Retrenchments
Sort
View
TON
2010
198views more  TON 2010»
13 years 2 months ago
On Wireless Scheduling Algorithms for Minimizing the Queue-Overflow Probability
Abstract-- In this paper, we are interested in wireless scheduling algorithms for the downlink of a single cell that can minimize the queue-overflow probability. Specifically, in a...
V. J. Venkataramanan, Xiaojun Lin
TSP
2010
13 years 2 months ago
Systematic construction of real lapped tight frame transforms
Abstract--We present a constructive algorithm for the design of real lapped equal-norm tight frame transforms. These transforms can be efficiently implemented through filter banks ...
Aliaksei Sandryhaila, Amina Chebira, Christina Mil...
TSP
2010
13 years 2 months ago
MIMO cognitive radio: a game theoretical approach
Abstract--The concept of cognitive radio (CR) has recently received great attention from the research community as a promising paradigm to achieve efficient use of the frequency re...
Gesualdo Scutari, Daniel Pérez Palomar
TSP
2010
13 years 2 months ago
Code design for radar STAP via optimization theory
Abstract--In this paper, we deal with the problem of constrained code optimization for radar space-time adaptive processing (STAP) in the presence of colored Gaussian disturbance. ...
Antonio De Maio, Silvio De Nicola, Yongwei Huang, ...
TWC
2010
13 years 2 months ago
Maximum-likelihood noncoherent OSTBC detection with polynomial complexity
Abstract--We prove that maximum-likelihood (ML) noncoherent sequence detection of orthogonal space-time block coded signals can always be performed in polynomial time with respect ...
Dimitris S. Papailiopoulos, George N. Karystinos