19866 search results - page 107 / 3974 » Computing all factorizations in *** |
152
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
Polynomial expressions are used to compute a wide variety of mathematical functions commonly found in signal processing and graphics applications, which provide good opportunities...
186
click to vote
JMLR
2010
15 years 1 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
147
click to vote
ICCD
2006
IEEE
16 years 3 months ago
2006
IEEE
Reed-Solomon (RS) codes are among the most widely utilized error-correcting codes in modern communication and computer systems. Among the decoding algorithms of RS codes, the rece...
144
click to vote
ISSAC
2004
Springer
15 years 11 months ago
2004
Springer
Many polynomial factorization algorithms rely on Hensel lifting and factor recombination. For bivariate polynomials we show that lifting the factors up to a precision linear in th...
148
click to vote
GI
2007
Springer
16 years 15 days ago
2007
Springer
: We study the factoring with known bits problem, where we are given a composite integer N = p1p2 . . . pr and oracle access to the bits of the prime factors pi, i = 1, . . . , r. ...