Sciweavers

357 search results - page 31 / 72
» On Reversibility and Determinism in P Systems
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
Reliable and Fast Eye Finding in Close-up Images
This paper describes a method for quickly and robustly localizing the iris and pupil boundaries of a human eye in close-up images. Such an algorithm can be critical for iris ident...
Theodore A. Camus, Richard P. Wildes
EUROCRYPT
2001
Springer
14 years 1 months ago
How Secure Are Elliptic Curves over Composite Extension Fields?
We compare the method of Weil descent for solving the ECDLP, over extensions fields of composite degree in characteristic two, against the standard method of parallelised Pollard ...
Nigel P. Smart
SI3D
1995
ACM
14 years 1 days ago
Portals and Mirrors: Simple, Fast Evaluation of Potentially Visible Sets
We describe an approach for determining potentially visible sets in dynamic architectural models. Our scheme divides the models into cells and portals, computing a conservative es...
David P. Luebke, Chris Georges
WSC
2007
13 years 10 months ago
Kriging metamodeling in constrained simulation optimization: an explorative study
This paper describes two experiments exploring the potential of the Kriging methodology for constrained simulation optimization. Both experiments study an (s, S) inventory system ...
William E. Biles, Jack P. C. Kleijnen, Wim C. M. V...
CHINAF
2008
69views more  CHINAF 2008»
13 years 8 months ago
Efficient Tate pairing computation using double-base chains
Pairing-based cryptosystems have been developing very fast in the last few years. The efficiencies of the cryptosystems are determined by the computation of the Tate pairing. In th...
Changan Zhao, Fangguo Zhang, Jiwu Huang