1552 search results - page 70 / 311 » On the Complexity of Constant Propagation |
168
click to vote
ANTS
2004
Springer
15 years 11 months ago
2004
Springer
On the lines of the binary gcd algorithm for rational integers, algorithms for computing the gcd are presented for the ring of integers in Q( √ d) where d ∈ {−2, −7, −11,...
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...
170
click to vote
FTDCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The global information service in the Internet is a heterogeneous and rapidly evolving environment. Constantly, new information services are added, others are modified, removed or...
171
click to vote
APPROX
2008
Springer
15 years 8 months ago
2008
Springer
We study the complexity of locally list-decoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that co...
176
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...