Sciweavers

11 search results - page 2 / 3
» A Remark on Implementing the Weil Pairing
Sort
View
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
13 years 9 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
IPPS
2000
IEEE
14 years 3 months ago
A Mechanism for Speculative Memory Accesses Following Synchronizing Operations
In order to reduce the overhead of synchronizing operations of shared memory multiprocessors, this paper proposes a mechanism, named specMEM, to execute memory accesses following ...
Takayuki Sato, Kazuhiko Ohno, Hiroshi Nakashima
AGP
1999
IEEE
14 years 3 months ago
Widening Sharing
We study the problem of an efficient and precise sharing analysis of (constraint) logic programs. After recognizing that neither aring nor its non-redundant (but equivalent) abstra...
Enea Zaffanella, Roberto Bagnara, Patricia M. Hill
DICTA
2003
14 years 6 days ago
Globally Optimal Surfaces by Continuous Maximal Flows
Abstract. In this paper we solve the problem of computing exact continuous optimal curves and surfaces for image segmentation and 3D reconstruction, using a maximal flow approach ...
Ben Appleton, Hugues Talbot
PAMI
2006
180views more  PAMI 2006»
13 years 10 months ago
Globally Minimal Surfaces by Continuous Maximal Flows
In this paper we consider the problem of computing globally minimal continuous curves and surfaces for image segmentation and 3D reconstruction. This is solved using a maximal flo...
Ben Appleton, Hugues Talbot