21 search results - page 1 / 5 » Faster algorithms for computing Hong's bound on absolute pos... |
JSC
2010
13 years 3 months ago
2010
We show how to compute Hong’s bound for the absolute positiveness of a polynomial in d variables with maximum degree δ in O(n logd n) time, where n is the number of non-zero co...
CVPR
2011
IEEE
12 years 8 months ago
2011
IEEE
The Perspective-Three-Point (P3P) problem aims at determining the position and orientation of the camera in the world reference frame from three 2D-3D point correspondences. This ...
SIAMMAX
2011
12 years 12 months ago
2011
Abstract. This paper concerns the computation of the coefficients ck of the characteristic polynomial of a real or complex matrix A. We analyze the forward error in the coefficient...
MASCOTS
2003
13 years 6 months ago
2003
Access latency to secondary storage devices is frequently a limiting factor in computer system performance. New storage technologies promise to provide greater storage densities a...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...