Sciweavers

ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
14 years 3 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
ARITH
1999
IEEE
14 years 3 months ago
Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3-D Vector
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
Naofumi Takagi, Seiji Kuwahara
SODA
2010
ACM
167views Algorithms» more  SODA 2010»
14 years 8 months ago
Inapproximability for planar embedding problems
We consider the problem of computing a minimumdistortion bijection between two point-sets in R2 . We prove the first non-trivial inapproximability result for this problem, for the...
Jeff Edmonds, Anastasios Sidiropoulos, Anastasios ...