358 search results - page 33 / 72 » Rank Matrix Factorisation |
120
click to vote
DAGSTUHL
2007
15 years 10 days ago
2007
Iterative aggregation/disaggregation methods (IAD) belong to competitive tools for computation the characteristics of Markov chains as shown in some publications devoted to testing...
106
click to vote
AUTOMATICA
2008
14 years 11 months ago
2008
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...
AUTOMATICA
2008
14 years 11 months ago
2008
The paper addresses methods for parameter sensitivity analysis in a large, nonlinear, mechanistic model which is to be run in an online estimation scheme. The parameter sensitivit...
88
Voted
CVPR
2005
IEEE
16 years 27 days ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
90
Voted
STACS
2007
Springer
15 years 5 months ago
2007
Springer
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...