Sciweavers

977 search results - page 4 / 196
» Secure Computation with Fixed-Point Numbers
Sort
View
MST
2008
150views more  MST 2008»
13 years 7 months ago
Coinduction for Exact Real Number Computation
This paper studies coinductive representations of real numbers by signed digit streams and fast Cauchy sequences. It is shown how the associated coinductive principle can be used ...
Ulrich Berger, Tie Hou
CG
2004
Springer
13 years 7 months ago
Views of Fibonacci dynamics
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
Clifford A. Reiter
JC
2002
50views more  JC 2002»
13 years 7 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
MOC
2010
13 years 2 months ago
Computing a lower bound for the canonical height on elliptic curves over number fields
Computing a lower bound for the canonical height is a crucial step in determining a Mordell
Thotsaphon Thongjunthug