The most important and expensive operation in a hyperelliptic curve cryptosystem (HECC) is scalar multiplication by an integer k, i.e., computing an integer k times a divisor D on ...
We prove that for any real-valued matrix X ∈ Rm×n , and positive integers r k, there is a subset of r columns of X such that projecting X onto their span gives a r+1 r−k+1 -a...
Multiplication of two numbers represented in base is shown to be computable by an on-line algorithm when is a negative integer, a positive non-integer real number, or a comp...
Abstract. Rewriting of conjunctive queries using views has many applications in database and data integration. We investigate ways to improve performance of rewriting and propose a...
Computing an equi-join followed by a duplicate eliminating projection is conventionally done by performing the two operations in serial. If some join attribute is projected away t...