1469 search results - page 24 / 294 » Approximate polynomial decomposition |
ISSAC
2009
Springer
15 years 4 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...
ISSAC
2004
Springer
15 years 3 months ago
2004
Springer
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. ...
JCO
2010
14 years 8 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
109
click to vote
STOC
1989
ACM
15 years 1 months ago
1989
ACM
We present a randomised polynomial time algorithm for approximating the volume of a convex body K in n-dimensional Euclidean space. The proof of correctness of the algorithm relie...
CAGD
2006
14 years 9 months ago
2006
We show that many rational parametric curves can be interpolated, in a Hermite sense, by polynomial curves whose degree, relative to the number of data being interpolated, is lowe...