Sciweavers

4714 search results - page 653 / 943
» The Complexity of Iterated Multiplication
Sort
View
CMA
2010
183views more  CMA 2010»
15 years 3 months ago
Ramanujan's class invariants and their use in elliptic curve cryptography
Complex Multiplication (CM) method is a frequently used method for the generation of elliptic curves (ECs) over a prime field Fp. The most demanding and complex step of this metho...
Elisavet Konstantinou, Aristides Kontogeorgis
DKE
2011
251views Education» more  DKE 2011»
15 years 1 months ago
Generating operation specifications from UML class diagrams: A model transformation approach
One of the more tedious and complex tasks during the specification of conceptual schemas (CSs) is modeling the operations that define the system behavior. This paper aims to simpl...
Manoli Albert, Jordi Cabot, Cristina Gómez,...
TCAD
2010
168views more  TCAD 2010»
15 years 1 months ago
An MILP-Based Performance Analysis Technique for Non-Preemptive Multitasking MPSoC
For real-time applications, it is necessary to estimate the worst-case performance early in the design process without actual hardware implementation. While the non-preemptive task...
Hoeseok Yang, Sungchan Kim, Soonhoi Ha
TIT
2010
160views Education» more  TIT 2010»
15 years 1 months ago
Parameterized splitting systems for the discrete logarithm
Hoffstein and Silverman suggested the use of low Hamming weight product (LHWP) exponents to accelerate group exponentiation while maintaining the security level. With LHWP exponent...
Sungwook Kim, Jung Hee Cheon
TNN
2010
143views Management» more  TNN 2010»
15 years 1 months ago
Using unsupervised analysis to constrain generalization bounds for support vector classifiers
Abstract--A crucial issue in designing learning machines is to select the correct model parameters. When the number of available samples is small, theoretical sample-based generali...
Sergio Decherchi, Sandro Ridella, Rodolfo Zunino, ...