Sciweavers

1369 search results - page 101 / 274
» Lattice computations for random numbers
Sort
View
ESANN
2004
13 years 10 months ago
Robust overcomplete matrix recovery for sparse sources using a generalized Hough transform
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
Fabian J. Theis, Pando G. Georgiev, Andrzej Cichoc...
TIT
2011
113views more  TIT 2011»
13 years 4 months ago
Eigen-Inference for Energy Estimation of Multiple Sources
—This paper introduces a new method to blindly estimate the transmit power of multiple signal sources in multiantenna fading channels, when the number of sensing devices and the ...
Romain Couillet, Jack W. Silverstein, Zhidong Bai,...
CSL
2010
Springer
13 years 9 months ago
Active learning and semi-supervised learning for speech recognition: A unified framework using the global entropy reduction maxi
We propose a unified global entropy reduction maximization (GERM) framework for active learning and semi-supervised learning for speech recognition. Active learning aims to select...
Dong Yu, Balakrishnan Varadarajan, Li Deng, Alex A...
CORR
2011
Springer
151views Education» more  CORR 2011»
13 years 24 days ago
A Stochastic-Geometry Approach to Coverage in Cellular Networks with Multi-Cell Cooperation
—Multi-cell cooperation is a promising approach for mitigating inter-cell interference in dense cellular networks. Quantifying the performance of multi-cell cooperation is challe...
Kaibin Huang, Jeffrey G. Andrews
GLOBECOM
2008
IEEE
14 years 3 months ago
Low-Complexity Maximum Likelihood Detection of Orthogonal Space-Time Block Codes
Abstract— In this paper, we propose a low complexity Maximum Likelihood (ML) decoding algorithm for orthogonal spacetime block codes (OSTBCs) based on the real-valued lattice rep...
Luay Azzam, Ender Ayanoglu