9736 search results - page 18 / 1948 » How Fast Can We Compute Products |
120
click to vote
CHI
2005
ACM
16 years 4 months ago
2005
ACM
Cryptographically protected email has a justly deserved reputation of being difficult to use. Based on an analysis of the PEM, PGP and S/MIME standards and a survey of 470 merchan...
132
click to vote
FLOPS
2008
Springer
15 years 5 months ago
2008
Springer
In this paper we describe some certified algorithms for exact real arithmetic based on co-recursion. Our work is based on previous experiences using redundant digits of base 2 but ...
161
click to vote
EDBT
2010
ACM
15 years 11 months ago
2010
ACM
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
138
click to vote
IPPS
2007
IEEE
15 years 10 months ago
2007
IEEE
— We consider memory subsystem optimizations for improving the performance of sparse scientific computation while reducing the power consumed by the CPU and memory. We first co...
140
click to vote
COMBINATORICA
2008
15 years 4 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...