Sciweavers

861 search results - page 4 / 173
» Faster integer multiplication
Sort
View
CTRSA
2006
Springer
183views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Efficient Doubling on Genus 3 Curves over Binary Fields
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 ...
Xinxin Fan, Thomas J. Wollinger, Yumin Wang
CORR
2011
Springer
168views Education» more  CORR 2011»
13 years 2 months ago
Optimal Column-Based Low-Rank Matrix Reconstruction
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...
Venkatesan Guruswami, Ali Kemal Sinop
ARITH
2003
IEEE
14 years 1 months ago
On-Line Multiplication in Real and Complex Base
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...
Christiane Frougny, Athasit Surarerks
AMW
2009
13 years 8 months ago
Using Patterns for Faster and Scalable Rewriting of Conjunctive Queries
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...
Ali Kiani, Nematollaah Shiri
ICDT
2009
ACM
129views Database» more  ICDT 2009»
14 years 8 months ago
Faster join-projects and sparse matrix multiplications
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...
Rasmus Resen Amossen, Rasmus Pagh