1 citations · 3 across the 10 of their papers we have counts for
Showing cs.SCShow all
3 papers · 1 filter
cs.SC2018
Computing Elimination Ideals and Discriminants of Likelihood Equations
Xiaoxian Tang, Timo De Wolff, Rukai Zhao
We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bas…
cs.SC2013
Generic Regular Decompositions for Parametric Polynomial Systems
Zhenghong Chen, Xiaoxian Tang, Bican Xia
This paper presents a generalization of our earlier work in [19]. In this paper, the two concepts, generic regular decomposition (GRD) and regular-decomposition-unstable (RDU) vari…
cs.SC2012
Generic Regular Decompositions for Generic Zero-Dimensional Systems
Xiaoxian Tang, Zhenghong Chen, Bican Xia
Two new concepts, generic regular decomposition and regular-decomposition-unstable (RDU) variety for generic zero-dimensional systems, are introduced in this paper and an algorithm…