Login / Signup
Bounds for approximating lower envelopes with polynomials of degree at most $d$.
Jesse Geneson
Published in:
CoRR (2016)
Keyphrases
</>
information retrieval
upper bound
lower bound
error bounds
information systems
special case
upper and lower bounds
average case
lagrange interpolation
data sets
computer vision
reinforcement learning
evolutionary algorithm
worst case
tight bounds