363 search results - page 5 / 73 » Finding Small Solutions to Small Degree Polynomials |
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
International Conference on Medical Image Computing and Computer Assisted Intervention, Beijing, China, 20-24 September 2010 Extracting numerous cells in a large microscopic image...
TC
1998
13 years 7 months ago
1998
—Let F2 denote the binary field and F 2 m an algebraic extension of degree m > 1 over F2 . Traditionally, elements of F 2 m are either represented as powers of a primitive ele...
ISSAC
2009
Springer
14 years 2 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
STOC
2005
ACM
14 years 8 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...