In 2006, Blake, Murty and Xu proposed three refinements to Miller’s algorithm for computing Weil/Tate Pairings. In this paper we extend their work and propose a generalized algo...
In this paper we define a novel similarity measure between examples of textual entailments and we use it as a kernel function in Support Vector Machines (SVMs). This allows us to ...
Objective: Comparison of program defects caused by programmer pairs and solo developers. Design: Analysis of programs developed during two counter balanced experiments. Setting: P...
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...
- Developments in CS1 pedagogy seek to improve the capabilities of students in their understanding of how to write programs. This involves learning how to solve various types of pr...