Sciweavers

327 search results - page 10 / 66
» Some Elimination Problems for Matrices
Sort
View
CSDA
2007
76views more  CSDA 2007»
13 years 9 months ago
Independent component analysis based on symmetrised scatter matrices
A new method for separating the mixtures of independent sources has been proposed recently in [8]. This method is based on two scatter matrices with the so called independence pro...
Sara Taskinen, S. Sirkiä, Hannu Oja
SIAMSC
2008
142views more  SIAMSC 2008»
13 years 8 months ago
Algebraic Multigrid Solvers for Complex-Valued Matrices
In the mathematical modeling of real-life applications, systems of equations with complex coefficients often arise. While many techniques of numerical linear algebra, e.g., Krylovs...
Scott MacLachlan, Cornelis W. Oosterlee
ENTCS
2008
110views more  ENTCS 2008»
13 years 10 months ago
A New Proposal Of Quasi-Solved Form For Equality Constraint Solving
Most well-known algorithms for equational solving are based on quantifier elimination. This technique iteratively eliminates the innermost block of existential/universal quantifie...
Javier Álvez, Paqui Lucio
CORR
2006
Springer
104views Education» more  CORR 2006»
13 years 9 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
VLDB
2004
ACM
163views Database» more  VLDB 2004»
14 years 3 months ago
Compressing Large Boolean Matrices using Reordering Techniques
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
David S. Johnson, Shankar Krishnan, Jatin Chhugani...