Sciweavers

42 search results - page 4 / 9
» Contrast Functions for Independent Subspace Analysis
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
On the Hardness and Smoothed Complexity of Quasi-Concave Minimization
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
Jonathan A. Kelner, Evdokia Nikolova
ICA
2007
Springer
14 years 1 months ago
Robust Independent Component Analysis Using Quadratic Negentropy
We present a robust algorithm for independent component analysis that uses the sum of marginal quadratic negentropies as a dependence measure. It can handle arbitrary source densit...
Jaehyung Lee, Taesu Kim, Soo-Young Lee
SIAMREV
2010
119views more  SIAMREV 2010»
13 years 2 months ago
From Functional Analysis to Iterative Methods
We examine condition numbers, preconditioners, and iterative methods for finite element discretizations of coercive PDEs in the context of the fundamental solvability result, the L...
Robert C. Kirby
TIT
2002
101views more  TIT 2002»
13 years 7 months ago
Large-system performance analysis of blind and group-blind multiuser receivers
We present a large-system performance analysis of blind and group-blind multiuser detection methods. In these methods, the receivers are estimated based on the received signal samp...
Junshan Zhang, Xiaodong Wang
ICA
2007
Springer
14 years 1 months ago
A Robust Complex FastICA Algorithm Using the Huber M-Estimator Cost Function
In this paper, we propose to use the Huber M-estimator cost function as a contrast function within the complex FastICA algorithm of Bingham and Hyvarinen for the blind separation o...
Jih-Cheng Chao, Scott C. Douglas