58 search results - page 4 / 12 » Two Families of Algorithms for Symbolic Polynomials |
LATIN
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
RECOMB
2010
Springer
13 years 8 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
ISSAC
2007
Springer
14 years 4 months ago
2007
Springer
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
SMI
1999
IEEE
14 years 2 months ago
1999
IEEE
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
IANDC
2011
13 years 4 months ago
2011
Partial transition systems support abstract model checking of complex temporal propercombining both over- and under-approximatingabstractions into a single model. Over the years, ...