137 search results - page 3 / 28 » Deformation Techniques for Efficient Polynomial Equation Sol... |
92
Voted
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
105
Voted
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
94
Voted
ICCV
2007
IEEE
16 years 2 months ago
2007
IEEE
The inverse gradient problem, finding a scalar field f with a gradient near a given vector field g on some bounded and connected domain Rn , can be solved by means of a Poisson ...
113
click to vote
AISC
2008
Springer
15 years 2 months ago
2008
Springer
Polynomial interpretations are a standard technique used in almost all tools for proving termination of term rewrite systems (TRSs) automatically. Traditionally, one applies interp...
103
click to vote
TEC
2008
15 years 9 days ago
2008
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...