4212 search results - page 49 / 843 » On Compressible Pairings and Their Computation |
ITICSE
2004
ACM
15 years 6 months ago
2004
ACM
Prior research on pair programming has found that compared to students who work alone, students who pair have shown increased confidence in their work, greater success in CS1, an...
161
Voted
PAIRING
2010
Springer
14 years 11 months ago
2010
Springer
This paper describes the design of a fast software library for the computation of the optimal ate pairing on a Barreto–Naehrig elliptic curve. Our library is able to compute the ...
119
Voted
KDD
2004
ACM
16 years 29 days ago
2004
ACM
Given a user-specified minimum correlation threshold and a market basket database with N items and T transactions, an all-strong-pairs correlation query finds all item pairs with...
116
click to vote
PAIRING
2007
Springer
15 years 6 months ago
2007
Springer
We derive a new algorithm for computing the Tate pairing on an elliptic curve over a finite field. The algorithm uses a generalisation of elliptic divisibility sequences known as...
108
click to vote
ICSE
2003
IEEE-ACM
16 years 19 days ago
2003
IEEE-ACM
This study examined the effectiveness of pair programming in four lecture sections of a large introductory programming course. We were particularly interested in assessing how the...