2430 search results - page 8 / 486 » Computing Tutte Polynomials |
UAI
2008
13 years 9 months ago
2008
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown p...
ISSAC
2001
Springer
14 years 3 days ago
2001
Springer
In this paper we present algorithms for simplifying ratios of trigonometric polynomials and algorithms for dividing, factoring and computing greatest common divisors of trigonomet...
ARITH
1993
IEEE
13 years 11 months ago
1993
IEEE
CIE
2008
Springer
13 years 9 months ago
2008
Springer
ISSAC
1997
Springer
13 years 11 months 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...