Results 221 to 230 of about 5,078 (233)
Some of the next articles are maybe not open access.
ACM Communications in Computer Algebra, 2015
In this presentation a new robust technique employing expectation maximization to separate outliers (corrupted data points) from inliers (true data points) iteratively, represented by different Gaussian distributions is introduced. Since in every iteration step, a new parameter estimation should be carried out, it is important to solve this parameter ...
Robert H. Lewis +2 more
openaire +1 more source
In this presentation a new robust technique employing expectation maximization to separate outliers (corrupted data points) from inliers (true data points) iteratively, represented by different Gaussian distributions is introduced. Since in every iteration step, a new parameter estimation should be carried out, it is important to solve this parameter ...
Robert H. Lewis +2 more
openaire +1 more source
Extended Dixon's resultant and its applications
1997Dixon's resultant method is an efficient way of simultaneously eliminating several variables from a system of nonlinear polynomial equations at a time. However, the method only works for systems of n + 1 generic n-degree polynomials in n variables and does not work for most algebraic and geometric problems.
openaire +1 more source
Comparing acceleration techniques for the dixon and macaulay resultants (abstract only)
ACM Communications in Computer Algebra, 2008The Bezout-Dixon resultant method for solving systems of polynomial equations lends itself to various heuristic acceleration techniques, previously reported by the present author [6], which can be extraordinarily effective. In this paper we will discuss how well these techniques apply to the Macaulay resultant. In brief, we find that they do work there
openaire +1 more source
An extended fast algorithm for constructing the Dixon resultant matrix
Science in China Series A, 2005In recent years, the Dixon resultant matrix has been used widely in the resultant elimination to solve nonlinear polynomial equations and many researchers have studied its efficient algorithms. The recursive algorithm is a very efficient algorithm, but which deals with the case of three polynomial equations with two variables at most. In this paper, we
openaire +1 more source
Automated geometric reasoning: Dixon resultants, Gröbner bases, and characteristic sets
1997Three different methods for automated geometry theorem proving—a generalized version of Dixon resultants, Grobner bases and characteristic sets—are reviewed. The main focus is, however, on the use of the generalized Dixon resultant formulation for solving geometric problems and determining geometric quantities.
openaire +1 more source