8669 search results - page 275 / 1734 » Computing matrix representations |
114
click to vote
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
128
Voted
ASAP
2006
IEEE
15 years 9 months ago
2006
IEEE
In the simulation of quantum circuits the matrices and vectors used to represent unitary operations and qubit states grow exponentially as the number of qubits increase. For insta...
135
Voted
IJCNN
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— In this paper, we propose a new nonlinear principal component analysis based on a generalized correlation function which we call correntropy. The data is nonlinearly tr...
122
Voted
ICANN
2005
Springer
15 years 9 months ago
2005
Springer
The power iteration is a classical method for computing the eigenvector associated with the largest eigenvalue of a matrix. The subspace iteration is an extension of the power iter...
112
Voted
CMMR
2003
Springer
15 years 8 months ago
2003
Springer
In the context of musical analysis, we propose an algorithm that automatically induces patterns from polyphonies. We define patterns as “perceptible repetitions in a musical piec...