26 search results - page 4 / 6 » From Coinductive Proofs to Exact Real Arithmetic |
CORR
2011
Springer
13 years 2 months ago
2011
Springer
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fo...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
We present a new algorithm for unfolding planar polygonal linkages without self-intersection based on following the gradient flow of a “repulsive” energy function. This algor...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
A number of minimal problems of structure from motion for cameras with radial distortion have recently been studied and solved in some cases. These problems are known to be numeri...
AAECC
2007
Springer
14 years 1 months ago
2007
Springer
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
TPHOL
2007
IEEE
14 years 1 months ago
2007
IEEE
Techniques based on sums of squares appear promising as a general approach to the universal theory of reals with addition and multiplication, i.e. verifying Boolean combinations of...