2563 search results - page 40 / 513 » Parallel matrix algorithms and applications |
AUTOMATICA
2008
13 years 10 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
PARA
1994
Springer
14 years 1 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
Matrix optimization with orthogonal constraints appear in a variety of application fields including signal and image processing. Several researchers have developed algorithms for...
SIGMOD
2008
ACM
14 years 10 months ago
2008
ACM
The problem of simultaneously clustering columns and rows (coclustering) arises in important applications, such as text data mining, microarray analysis, and recommendation system...
ICDE
2008
IEEE
14 years 11 months ago
2008
IEEE
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...