1469 search results - page 36 / 294 » Approximate polynomial decomposition |
DATE
1999
IEEE
15 years 4 months ago
1999
IEEE
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
IROS
2007
IEEE
15 years 6 months ago
2007
IEEE
— This paper introduces box approximations as a new tool for path planning of closed-loop linkages. Box approximations are finite collections of rectangloids that tightly envelo...
CASC
2007
Springer
15 years 6 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
IJAC
2006
14 years 11 months ago
2006
By the fundamental theorem of symmetric polynomials, if P Q[X1, . . . , Xn] is symmetric, then it can be written P = Q(1, . . . , n), where 1, . . . , n are the elementary symmet...
COMPGEOM
2008
ACM
15 years 1 months ago
2008
ACM
We present a method to compute the exact topology of a real algebraic surface S, implicitly given by a polynomial f