Sciweavers

236 search results - page 22 / 48
» Fast Sparse Matrix Multiplication
Sort
View
NIPS
2007
14 years 11 months ago
Probabilistic Matrix Factorization
Many existing approaches to collaborative filtering can neither handle very large datasets nor easily deal with users who have very few ratings. In this paper we present the Prob...
Ruslan Salakhutdinov, Andriy Mnih
ICASSP
2009
IEEE
14 years 7 months ago
Weighted nonnegative matrix factorization
Nonnegative matrix factorization (NMF) is a widely-used method for low-rank approximation (LRA) of a nonnegative matrix (matrix with only nonnegative entries), where nonnegativity...
Yong-Deok Kim, Seungjin Choi
68
Voted
JACM
2000
119views more  JACM 2000»
14 years 9 months ago
A subdivision-based algorithm for the sparse resultant
Multivariate resultants generalize the Sylvester resultant of two polynomials and characterize the solvability of a polynomial system. They also reduce the computation of all comm...
John F. Canny, Ioannis Z. Emiris
TROB
2008
123views more  TROB 2008»
14 years 9 months ago
iSAM: Incremental Smoothing and Mapping
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...
Michael Kaess, Ananth Ranganathan, Frank Dellaert
90
Voted
TSP
2008
151views more  TSP 2008»
14 years 9 months ago
Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
The rapid developing area of compressed sensing suggests that a sparse vector lying in a high dimensional space can be accurately and efficiently recovered from only a small set of...
Moshe Mishali, Yonina C. Eldar