Sciweavers

MP
2008
80views more  MP 2008»
13 years 4 months ago
Modified Cholesky algorithms: a catalog with new approaches
Given an n
Haw-ren Fang, Dianne P. O'Leary
CORR
2010
Springer
153views Education» more  CORR 2010»
13 years 4 months ago
Towards an Efficient Tile Matrix Inversion of Symmetric Positive Definite Matrices on Multicore Architectures
The algorithms in the current sequential numerical linear algebra libraries (e.g. LAPACK) do not parallelize well on multicore architectures. A new family of algorithms, the tile a...
Emmanuel Agullo, Henricus Bouwmeester, Jack Dongar...
CDC
2009
IEEE
221views Control Systems» more  CDC 2009»
13 years 8 months ago
Parametrization invariant covariance quantification in identification of transfer functions for linear systems
This paper adresses the variance quantification problem for system identification based on the prediction error framework. The role of input and model class selection for the auto-...
Tzvetan Ivanov, Michel Gevers
ICML
2002
IEEE
14 years 5 months ago
Learning the Kernel Matrix with Semi-Definite Programming
Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is perfor...
Gert R. G. Lanckriet, Nello Cristianini, Peter L. ...
ICML
2007
IEEE
14 years 5 months ago
Winnowing subspaces
We generalize the Winnow algorithm for learning disjunctions to learning subspaces of low rank. Subspaces are represented by symmetric projection matrices. The online algorithm ma...
Manfred K. Warmuth