Login / Signup
The Secant-Newton Map is Optimal Among Contracting $n^{th}$ Degree Maps for $n^{th}$ Root Computation.
Kayla Bishop
Hoon Hong
Published in:
CoRR (2014)
Keyphrases
</>
dynamic programming
geographical data
closed form
efficient computation
single parameter
genetic algorithm
reinforcement learning
upper bound
least squares
tree structure
optimal design
feature maps
maximum a posteriori probability