764 search results - page 48 / 153 » Maximum-Margin Matrix Factorization |
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The K-means clustering problem seeks to partition the columns of a data matrix in subsets, such that columns in the same subset are ‘close’ to each other. The co-clustering pr...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
The multiplicative algorithms are well-known for nonnegative matrix and tensor factorizations. The ALS algorithm for canonical decomposition (CP) has been proved as a “workhorse...
TROB
2008
14 years 9 months ago
2008
We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. i...
EUROCRYPT
2000
Springer
15 years 1 months ago
2000
Springer
We describe an enhanced version of the TWINKLE factoring device and analyse to what extent it can be expected to speed up the sieving step of the Quadratic Sieve and Number Field S...
TOMS
2008
14 years 9 months ago
2008
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...