Browsing Division of Electrical, Electronics, and Computer Science (EECS) by Subject "Parallel Computing"
Now showing items 1-2 of 2
-
Counting number of points on elliptic curves over F2m fields : An implementation study
Hasse’s theorem states that:ifE {W g) Then |i| < 2y/q. This gives the bound on the number of points. In 1985, Schoof presented a polynomial time algorithm for computing The algorithm has running time of 0(log® q) bit ... -
Polymage : Automatic Optimization for Image Processing Pipelines
(2018-06-25)Image processing pipelines are ubiquitous. Every image captured by a camera and every image uploaded on social networks like Google+or Facebook is processed by a pipeline. Applications in a wide range of domains like ...

