1380 search results - page 6 / 276 » A General Polynomial Sieve |
STOC
1999
ACM
14 years 27 days ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
GECCO
2000
Springer
14 years 6 days ago
2000
Springer
In previous work we showed, by Walsh analysis, that summary statistics such as mean, variance, skew, and higher order statistics can be computed in polynomial time for embedded la...
ICIP
1999
IEEE
14 years 10 months ago
1999
IEEE
ISSAC
2005
Springer
14 years 2 months ago
2005
Springer
This paper describes a new method for computing the normal form of a polynomial modulo a zero-dimensional ideal I. We give a detailed description of the algorithm, a proof of its ...
ICIP
1998
IEEE
14 years 10 months ago
1998
IEEE
Generalized Hermite polynomials in two variables are employed for the reconstruction of images from a knowledge of their zero crossing contours. The problem of reconstruction of s...