577 search results - page 17 / 116 » Computing Rational Bisectors |
DMTCS
2003
13 years 9 months ago
2003
Let h : N → Q be a computable function. A real number x is h-monotonically computable (h-mc, for short) if there is a computable sequence (xs) of rational numbers which converges...
ISSAC
1999
Springer
14 years 8 days ago
1999
Springer
In this paper we consider the problem of fast computation of n-ary products, for large n, over arbitrary precision integer or rational number domains. The combination of loop unro...
ISSAC
1997
Springer
14 years 5 days ago
1997
Springer
Abstract. This paper presents a modular algorithm for computing the greatest common right divisor (gcrd) of two univariate Ore polynomials over Z[t]. The subresultants of Ore polyn...
ICS
2010
Tsinghua U.
14 years 5 months ago
2010
Tsinghua U.
CVPR
1997
IEEE
14 years 7 days ago
1997
IEEE