Login / Signup
q-Blossoming: A new approach to algorithms and identities for q-Bernstein bases and q-Bézier curves.
Plamen Simeonov
Vasilis Zafiris
Ron Goldman
Published in:
J. Approx. Theory (2012)
Keyphrases
</>
orders of magnitude
learning algorithm
significant improvement
worst case
computational cost
times faster
recently developed
information systems
search engine
computational complexity
optimization problems
computationally efficient
benchmark datasets
computationally expensive