22 search results - page 1 / 5 » ECC: Do We Need to Count |
ASIACRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. A prohibitive barrier faced by elliptic curve users is the difficulty of computing the curves’ cardinalities. Despite recent theoretical breakthroughs, point counting ...
ASPLOS
2010
ACM
14 years 4 days ago
2010
ACM
We present a general scheme for virtualizing main memory errorcorrection mechanisms, which map redundant information needed to correct errors into the memory namespace itself. We ...
DSVIS
2006
Springer
13 years 9 months ago
2006
Springer
This keynote paper argues for an increased understanding of the various roles involved in the development work to be able to achieve the goal of developing increased usability. Hum...
OPODIS
2004
13 years 6 months ago
2004
The main contribution of this paper is that it shows that it is possible to have reactive distributed trees for counting and balancing with no need for the user to fix manually any...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets), is motivated by applications in a variety of areas ranging from Biolo...