Results 1  10
of
75,866
BarretoNaehrig Curves
, 2014
"... draftkasamatsubncurves01 Elliptic curves with pairings are useful tools for constructing cryptographic primitives. In this memo, we specify domain parameters of BarretoNaehrig curves (BNcurves) [5]. The BNcurve is an elliptic curve suitable for pairings and allows us to achieve high security a ..."
Abstract
 Add to MetaCart
draftkasamatsubncurves01 Elliptic curves with pairings are useful tools for constructing cryptographic primitives. In this memo, we specify domain parameters of BarretoNaehrig curves (BNcurves) [5]. The BNcurve is an elliptic curve suitable for pairings and allows us to achieve high security
Designing an ASIP for Cryptographic Pairings over BarretoNaehrig Curves
, 2009
"... This paper presents a designspace exploration of an applicationspecific instructionset processor (ASIP) for the computation of various cryptographic pairings over BarretoNaehrig curves (BN curves). Cryptographic pairings are based on elliptic curves over finite fields—in the case of BN curves a ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This paper presents a designspace exploration of an applicationspecific instructionset processor (ASIP) for the computation of various cryptographic pairings over BarretoNaehrig curves (BN curves). Cryptographic pairings are based on elliptic curves over finite fields—in the case of BN curves a
Faster Fparithmetic for Cryptographic Pairings on BarretoNaehrig Curves
"... This paper describes a new method to speed up Fparithmetic for BarretoNaehrig (BN) curves. We explore the characteristics of the modulus defined by BN curves and choose curve parameters such that Fp multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a poly ..."
Abstract

Cited by 12 (3 self)
 Add to MetaCart
This paper describes a new method to speed up Fparithmetic for BarretoNaehrig (BN) curves. We explore the characteristics of the modulus defined by BN curves and choose curve parameters such that Fp multiplication becomes more efficient. The proposed algorithm uses Montgomery reduction in a
Auction Theory: A Guide to the Literature
 JOURNAL OF ECONOMIC SURVEYS
, 1999
"... This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub.), forthco ..."
Abstract

Cited by 528 (4 self)
 Add to MetaCart
This paper provides an elementary, nontechnical, survey of auction theory, by introducing and describing some of the critical papers in the subject. (The most important of these are reproduced in a companion book, The Economic Theory of Auctions, Paul Klemperer (ed.), Edward Elgar (pub
Detecting faces in images: A survey
 IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE
, 2002
"... Images containing faces are essential to intelligent visionbased human computer interaction, and research efforts in face processing include face recognition, face tracking, pose estimation, and expression recognition. However, many reported methods assume that the faces in an image or an image se ..."
Abstract

Cited by 831 (4 self)
 Add to MetaCart
sequence have been identified and localized. To build fully automated systems that analyze the information contained in face images, robust and efficient face detection algorithms are required. Given a single image, the goal of face detection is to identify all image regions which contain a face regardless
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical
The selfduality equations on a Riemann surface
 Proc. Lond. Math. Soc., III. Ser
, 1987
"... In this paper we shall study a special class of solutions of the selfdual YangMills equations. The original selfduality equations which arose in mathematical physics were defined on Euclidean 4space. The physically relevant solutions were the ones with finite action—the socalled 'instanton ..."
Abstract

Cited by 524 (6 self)
 Add to MetaCart
In this paper we shall study a special class of solutions of the selfdual YangMills equations. The original selfduality equations which arose in mathematical physics were defined on Euclidean 4space. The physically relevant solutions were the ones with finite action—the socalled &apos
FAST VOLUME RENDERING USING A SHEARWARP FACTORIZATION OF THE VIEWING TRANSFORMATION
, 1995
"... Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques that req ..."
Abstract

Cited by 541 (2 self)
 Add to MetaCart
Volume rendering is a technique for visualizing 3D arrays of sampled data. It has applications in areas such as medical imaging and scientific visualization, but its use has been limited by its high computational expense. Early implementations of volume rendering used bruteforce techniques
Robust Monte Carlo Localization for Mobile Robots
, 2001
"... Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples), whi ..."
Abstract

Cited by 826 (88 self)
 Add to MetaCart
Mobile robot localization is the problem of determining a robot's pose from sensor data. This article presents a family of probabilistic localization algorithms known as Monte Carlo Localization (MCL). MCL algorithms represent a robot's belief by a set of weighted hypotheses (samples
Results 1  10
of
75,866