3405 search results - page 55 / 681 » Factoring Groups Efficiently |
169
click to vote
ICDM
2009
IEEE
15 years 3 months ago
2009
IEEE
Matrix factorization (MF) models have proved efficient and well scalable for collaborative filtering (CF) problems. Many researchers also present the probabilistic interpretation o...
125
click to vote
SIAMMAX
2010
15 years 27 days ago
2010
This article presents rigorous normwise perturbation bounds for the Cholesky, LU and QR factorizations with normwise or componentwise perturbations in the given matrix. The conside...
144
click to vote
P2P
2002
IEEE
15 years 11 months ago
2002
IEEE
Emerging peer-to-peer applications require efficient group communication. However, current techniques for group communication are not optimal for peer-to-peer networks, which do n...
162
click to vote
CVPR
2008
IEEE
16 years 8 months ago
2008
IEEE
Over the years, many tensor based algorithms, e.g. two dimensional principle component analysis (2DPCA), two dimensional singular value decomposition (2DSVD), high order SVD, have...
158
click to vote
SDM
2010
SIAM
15 years 7 months ago
2010
SIAM
Real-world relational data are seldom stationary, yet traditional collaborative filtering algorithms generally rely on this assumption. Motivated by our sales prediction problem, ...