19866 search results - page 134 / 3974 » Computing all factorizations in *** |
191
click to vote
EUROPAR
2011
Springer
14 years 6 months ago
2011
Springer
: Tuning numerical libraries has become more difficult over time, as systems get more sophisticated. In particular, modern multicore machines make the behaviour of algorithms hard ...
189
click to vote
CVPR
2012
IEEE
13 years 8 months ago
2012
IEEE
This paper proposes a simple “prior-free” method for solving non-rigid structure-from-motion factorization problems. Other than using the basic low-rank condition, our method ...
175
click to vote
ICIP
2000
IEEE
16 years 8 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...
180
click to vote
ISSAC
1997
Springer
15 years 10 months ago
1997
Springer
New algorithms are presented for factoring polynomials of degree n over the finite field of q elements, where q is a power of a fixed prime number. When log q = n1+a , where a ...
205
click to vote
SAB
2010
Springer
15 years 4 months ago
2010
Springer
Reinforcement learning is one of the main adaptive mechanisms that is both well documented in animal behaviour and giving rise to computational studies in animats and robots. In th...