764 search results - page 49 / 153 » Maximum-Margin Matrix Factorization |
ICIP
2000
IEEE
15 years 11 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...
101
click to vote
PKC
2007
Springer
15 years 4 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...
JCT
1998
14 years 9 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...
IDA
2008
Springer
14 years 10 months ago
2008
Springer
A principally new approach to the classifications of nucleotide sequences based on the "natural" classification concept is proposed. As a result of "natural" c...
SIAMMAX
2010
14 years 4 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...