Sciweavers

2239 search results - page 95 / 448
» Computing with abstract matrix structures
Sort
View
ICA
2004
Springer
15 years 5 months ago
Blind Source Separation Using the Block-Coordinate Relative Newton Method
Presented here is a generalization of the modified relative Newton method, recently proposed in [1] for quasi-maximum likelihood blind source separation. Special structure of the ...
Alexander M. Bronstein, Michael M. Bronstein, Mich...
ACL
2010
14 years 10 months ago
The S-Space Package: An Open Source Package for Word Space Models
We present the S-Space Package, an open source framework for developing and evaluating word space algorithms. The package implements well-known word space algorithms, such as LSA,...
David Jurgens, Keith Stevens
ORL
2011
14 years 6 months ago
Solving large Steiner Triple Covering Problems
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to small set covering instances that provide a computational challenge for integer programming ...
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, S...
VTC
2007
IEEE
104views Communications» more  VTC 2007»
15 years 6 months ago
Subspace Tracking Based Blind MIMO Transmit Preprocessing
Abstract— In this contribution projection approximation subspace tracking using deflation (PASTD) is investigated in the context of MIMO transmit preprocessing systems by exploi...
Wei Liu, Lie-Liang Yang, Lajos Hanzo
CORR
2008
Springer
116views Education» more  CORR 2008»
14 years 11 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard