Sciweavers

1523 search results - page 179 / 305
» The Computational Complexity of Linear Optics
Sort
View
IPPS
2007
IEEE
15 years 10 months ago
Probability Convergence in a Multithreaded Counting Application
The problem of counting specified combinations of a given set of variables arises in many statistical and data mining applications. To solve this problem, we introduce the PDtree...
Chad Scherrer, Nathaniel Beagley, Jarek Nieplocha,...
PAIRING
2007
Springer
140views Cryptology» more  PAIRING 2007»
15 years 10 months ago
The Tate Pairing Via Elliptic Nets
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...
Katherine E. Stange
AINA
2006
IEEE
15 years 10 months ago
Dual RSA Accumulators and Its Application for Private Revocation Check
This paper points out the privacy issue in the OCSP (Online Certificate Status Protocol), namely, the OCSP responder learns confidential information – who sends a message to w...
Hiroaki Kikuchi
SC
2005
ACM
15 years 9 months ago
How Well Can Simple Metrics Represent the Performance of HPC Applications?
In this paper, a systematic study of the effects of complexity of prediction methodology on its accuracy for a set of real applications on a variety of HPC systems is performed. R...
Laura Carrington, Michael Laurenzano, Allan Snavel...
IPPS
2003
IEEE
15 years 9 months ago
MIP Formulation for Robust Resource Allocation in Dynamic Real-Time Systems
Real-time systems usually operate in an environment that changes continuously. These changes cause the performance of the system to vary during run time. An allocation of resource...
Sethavidh Gertphol, Viktor K. Prasanna