A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
With the aid of an errorbound arithmetic (see [4]), formulas are given for the computation of approximate values plus errorbounds for integrals. In the simplest case, no further information is required about the integrand (e. g. bounds for derivatives, etc.). The formulas can be given for each order of exactitude, the order for the approximate value being, in general, one higher than the order of the errorbounds. Examples show that the errorbounds are generally very sharp. It is possible to use the information given by the errorbounds for the fully automatic ending of the quadrature at the "optimal" point. © 1966 Springer-Verlag.
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Kento Tsubouchi, Yosuke Mitsuhashi, et al.
npj Quantum Information
Limin Hu
IEEE/ACM Transactions on Networking