577 search results - page 58 / 116 » Computing Rational Bisectors |
TCS
2008
13 years 7 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...
DAC
2009
ACM
14 years 2 months ago
2009
ACM
This paper describes an automatic methodology for optimizing sample point selection for using in the framework of model order reduction (MOR). The procedure, based on the maximiza...
ESA
2004
Springer
14 years 1 months ago
2004
Springer
We study polynomials of degree up to 4 over the rationals or a computable real subfield. Our motivation comes from the need to evaluate predicates in nonlinear computational geome...
ICALP
2004
Springer
14 years 1 months ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
CGI
1999
IEEE
14 years 6 days ago
1999
IEEE
Existing data embedding algorithms for polygonal meshes and their attributes can't be applied to the majority of (geometric) computer aided design (CAD) applications, for two...