203 search results - page 24 / 41 » An Introduction to Convex Optimization for Communications an... |
ICASSP
2010
IEEE
13 years 8 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
We show that the exact recovery of sparse perturbations on the coefficient matrix in overdetermined Least Squares problems is possible for a large class of perturbation structure...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper describes subspace constrained feature space maximum likelihood linear regression (FMLLR) for rapid adaptation. The test speaker’s FMLLR rotation matrix is decomposed...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
Owing to the non-zero probability of the missed detection and false alarm of active primary transmission, a certain degree of performance degradation of the primary user (PU) from...
ICASSP
2008
IEEE
14 years 2 months ago
2008
IEEE
—We aim to characterize the maximum link throughput of a multi-channel opportunistic communication system. The states of these channels evolve as independent and identically dist...