Sciweavers

8669 search results - page 141 / 1734
» Computing matrix representations
Sort
View
SIAMMAX
2011
157views more  SIAMMAX 2011»
13 years 5 hour ago
Deflated Restarting for Matrix Functions
We investigate an acceleration technique for restarted Krylov subspace methods for computing the action of a function of a large sparse matrix on a vector. Its effect is to ultima...
Michael Eiermann, Oliver G. Ernst, Stefan Güt...
SCALESPACE
2007
Springer
14 years 3 months ago
A Generic Approach to the Filtering of Matrix Fields with Singular PDEs
Abstract. There is an increasing demand to develop image processing tools for the filtering and analysis of matrix-valued data, so-called matrix fields. In the case of scalar-val...
Bernhard Burgeth, Stephan Didas, Luc Florack, Joac...
ISCAS
2006
IEEE
112views Hardware» more  ISCAS 2006»
14 years 3 months ago
Towards an optimised VLSI design algorithm for the constant matrix multiplication problem
The efficient design of multiplierless implementa- The goal is to find the optimal sub-expressions across all N dot tions of constant matrix multipliers is challenged by the huge p...
Andrew Kinane, Valentin Muresan, Noel E. O'Connor
ECML
2006
Springer
14 years 26 days ago
Fast Spectral Clustering of Data Using Sequential Matrix Compression
Spectral clustering has attracted much research interest in recent years since it can yield impressively good clustering results. Traditional spectral clustering algorithms first s...
Bo Chen, Bin Gao, Tie-Yan Liu, Yu-Fu Chen, Wei-Yin...
CORR
2010
Springer
175views Education» more  CORR 2010»
13 years 9 months ago
Incorporating Side Information in Probabilistic Matrix Factorization with Gaussian Processes
Probabilistic matrix factorization (PMF) is a powerful method for modeling data associated with pairwise relationships, finding use in collaborative filtering, computational biolo...
Ryan Prescott Adams, George E. Dahl, Iain Murray