ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
We give an elementary way to distinguish between the twists of an ordinary elliptic curve E over Fp in order to identify the one with p+1-2U points, when p = U2 + dV 2 with 2U, 2V ...
We propose a compact architecture of a Montgomery elliptic curve scalar multiplier in a projective coordinate system over GF(2m ). To minimize the gate area of the architecture, we...
: A mass of heterogeneous, distributed and dynamic information on the World Wide Web (the Web) has resulted in "information overload". It's an important and urgent r...
Jicheng Wang, Xiangyu Jin, Yang Xiaojiang, Fuyan Z...
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...