1203 search results - page 57 / 241 » Probabilistic Matrix Factorization |
102
click to vote
TOMS
2008
15 years 1 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...
109
click to vote
ICIP
2000
IEEE
16 years 3 months ago
2000
IEEE
Factorization methods use linear subspace constraints to recover 3D rigid structure from 2D motion. Usually, these methods give equal weight to the contribution of each region (or...
133
click to vote
NIPS
2000
15 years 3 months ago
2000
We describe a joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives. The model is...
138
click to vote
PKC
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. For RSA, May showed a deterministic polynomial time equivalence of computing d to factoring N(= pq). On the other hand, Takagi showed a variant of RSA such that the decry...
113
click to vote
JCT
1998
15 years 1 months ago
1998
We show that any k-regular bipartite graph with 2n vertices has at least ((k−1)k−1 kk−2 )n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent...