4212 search results - page 64 / 843 » On Compressible Pairings and Their Computation |
IPPS
2005
IEEE
15 years 6 months ago
2005
IEEE
With the latest high-end computing nodes combining shared-memory multiprocessing with hardware multithreading, new scheduling policies are necessary for workloads consisting of mu...
IJNSEC
2006
15 years 17 days ago
2006
Batch verification can provide large computational savings when multiple signatures are verified together. Recently, some batch verifying signature schemes have been proposed from...
106
click to vote
IPL
2002
15 years 8 days ago
2002
Given a planar point set, we wish to label the points with uniform circular labels such that each input point lies on the boundary of two labels, none of the interiors of the labe...
119
Voted
TIP
2002
15 years 6 days ago
2002
This paper proposes the localization algorithm that estimates translation parameters of an aircraft by comparing the sampled elevation map recovered from aerial sequence images, an...
99
Voted
ASIACRYPT
2010
Springer
14 years 10 months ago
2010
Springer
We construct non-interactive zero-knowledge arguments for circuit satisfiability with perfect completeness, perfect zero-knowledge and computational soundness. The non-interactive ...