Sciweavers

3946 search results - page 256 / 790
» The computational complexity of choice sets
Sort
View
PVM
2005
Springer
16 years 6 days ago
A Case for New MPI Fortran Bindings
Abstract. The Fortran language has evolved substantially from the Fortran 77 bindings defined in the MPI-1 (Message Passing Interface) standard. Fortran 90 introduced interface bl...
Craig Edward Rasmussen, Jeffrey M. Squyres
ICIAP
2003
ACM
15 years 12 months ago
PCA vs low resolution images in face verification
Principal Components Analysis (PCA) has been one of the most applied methods for face verification using only 2D information, in fact, PCA is practically the method of choice for ...
Cristina Conde, Antonio Ruiz, Enrique Cabello
DATE
1998
IEEE
100views Hardware» more  DATE 1998»
15 years 11 months ago
Combinational Verification based on High-Level Functional Specifications
We present a new combinational verification technique where the functional specification of a circuit under verification is utilized to simplify the verification task. The main id...
Evguenii I. Goldberg, Yuji Kukimoto, Robert K. Bra...
IJNSEC
2008
135views more  IJNSEC 2008»
15 years 6 months ago
Software Implementations of Elliptic Curve Cryptography
Elliptic Curve Cryptography (ECC) is a promising alternative for public-key algorithms in resource-constrained systems because it provides a similar level of security with much sh...
Zhijie Jerry Shi, Hai Yun
CORR
2011
Springer
221views Education» more  CORR 2011»
15 years 1 months ago
Course on System Design (structural approach)
—The article describes a course on system design (structural approach) which involves the following: issues of systems engineering; structural models; basic technological problem...
Mark Sh. Levin