36781 search results - page 53 / 7357 » Parameterizing by the Number of Numbers |
ASIACRYPT
2003
Springer
14 years 3 months ago
2003
Springer
We present an algorithm that finds polynomials with many roots modulo many primes by rotating candidate Number Field Sieve polynomials using the Chinese Remainder Theorem. We also...
COMPGEOM
2007
ACM
14 years 2 months ago
2007
ACM
Given a finite set of points S in Rd , consider visiting the points in S with a polygonal path which makes a minimum number of turns, or equivalently, has the the minimum number o...
FPL
2006
Springer
14 years 1 months ago
2006
Springer
This paper describes a solution for the generation of true random numbers in a purely digital fashion; making it suitable for any FPGA type, because no FPGA vendor specific featur...
GECCO
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we study the performances of the NEW Unconstrained Optimization Algorithm (NEWUOA) with different numbers of interpolation points. NEWUOA is a trust region method, ...
DELTA
2008
IEEE
13 years 12 months ago
2008
IEEE
This paper presents a technique that limits the maximum number of specified bits of any pattern in a given test set. The outlined method uses algorithms similar to ATPG, but explo...