81 search results - page 8 / 17 » Using fast matrix multiplication to solve structured linear ... |
SCIA
2009
Springer
15 years 4 months ago
2009
Springer
Many computer vision problems can be formulated as low rank bilinear minimization problems. One reason for the success of these problems is that they can be efficiently solved usin...
67
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
DATAMINE
1999
14 years 9 months ago
1999
The clustering algorithm DBSCAN relies on a density-based notion of clusters and is designed to discover clusters of arbitrary shape as well as to distinguish noise. In this paper,...
IJON
1998
14 years 9 months ago
1998
In this paper we employ information theoretic algorithms, previously used for separating instantaneous mixtures of sources, for separating convolved mixtures in the frequency doma...
74
Voted
PIMRC
2010
IEEE
14 years 7 months ago
2010
IEEE
This paper tackles the problem of fast varying channel estimation in LTE systems. Particular attention is given to downlink transmission where OFDMA is used as the multiple access ...