2766 search results - page 287 / 554 » Algorithms for trigonometric polynomials |
175
click to vote
GI
2007
Springer
16 years 1 months 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. ...
159
click to vote
ISSAC
2007
Springer
16 years 1 months ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
175
click to vote
WG
2007
Springer
16 years 1 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
174
click to vote
CEC
2005
IEEE
16 years 25 days ago
2005
IEEE
We consider the (1+λ) evolution strategy, an evolutionary algorithm for minimization in Rn , using isotropic mutations. Thus, for instance, Gaussian mutations adapted by the 1/5-r...
143
click to vote
CSB
2005
IEEE
16 years 25 days ago
2005
IEEE
We study the parsimony approach to haplotype inference, which calls for finding a set of haplotypes of minimum cardinality that explains an input set of genotypes. We prove that ...