A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...