Abstract. Miller’s algorithm for computing pairings involves performing multiplications between elements that belong to different finite fields. Namely, elements in the full e...
Craig Costello, Colin Boyd, Juan Manuel Gonz&aacut...
The classical approach to depth from defocus uses two
images taken with circular apertures of different sizes. We
show in this paper that the use of a circular aperture
severely...
This paper describes an intelligent agent to facilitate bitext mining from the Web via automatic discovery of URL pairing patterns (or keys) for retrieving parallel web pages. The...
Abstract. This paper presents a design-space exploration of an applicationspecific instruction-set processor (ASIP) for the computation of various cryptographic pairings over Barre...
David Kammler, Diandian Zhang, Dominik Auras, Gerd...
We develop data structures for dynamic closest pair problems with arbitrary (not necessarily geometric) distance functions, based on a technique previously used by the author for ...