Sciweavers

280 search results - page 9 / 56
» On matrices with the Edmonds-Johnson property
Sort
View
COCO
2005
Springer
106views Algorithms» more  COCO 2005»
14 years 1 months ago
The Complexity of the Inertia and Some Closure Properties of GapL
The inertia of an n × n matrix A is defined as the triple (i+(A), i−(A), i0(A)), where i+(A), i−(A), and i0(A) are the number of eigenvalues of A, counting multiplicities, w...
Thanh Minh Hoang, Thomas Thierauf
CSDA
2008
115views more  CSDA 2008»
13 years 7 months ago
Complex-valued ICA based on a pair of generalized covariance matrices
It is shown that any pair of scatter and spatial scatter matrices yields an estimator of the separating matrix for complex-valued independent component analysis (ICA). Scatter (re...
Esa Ollila, Hannu Oja, Visa Koivunen
TCOM
2008
68views more  TCOM 2008»
13 years 7 months ago
MPSK modulated constellation design for differential space-time modulation
The constellation design for differential space-time modulation usually requires to construct L (constellation size) unitary matrices making the design complexity increasing rapidl...
Qinghua Shi, Q. T. Zhang
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 7 months ago
On Universally Decodable Matrices for Space-Time Coding
The notion of universally decodable matrices (UDMs) was recently introduced by Tavildar and Viswanath while studying slow fading channels. It turns out that the problem of construc...
Pascal O. Vontobel, Ashwin Ganesan
IPPS
2000
IEEE
14 years 17 hour ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen