A general framework for subexponential discrete logarithm algorithms
Andreas Enge, Pierrick Gaudry (2002)
Acta Arithmetica
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Andreas Enge, Pierrick Gaudry (2002)
Acta Arithmetica
Similarity:
M. Fox (1980)
Applicationes Mathematicae
Similarity:
Sabeur Ammar, Jean-Claude Vivalda (2010)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
In this paper, we prove the genericity of the observability for discrete-time systems with more outputs than inputs.
Hristu-Varsakelis, D., Kyrtsou, C. (2008)
Discrete Dynamics in Nature and Society
Similarity:
Bogdan Trawiński, Magdalena Smętek, Zbigniew Telec, Tadeusz Lasota (2012)
International Journal of Applied Mathematics and Computer Science
Similarity:
In the paper we present some guidelines for the application of nonparametric statistical tests and post-hoc procedures devised to perform multiple comparisons of machine learning algorithms. We emphasize that it is necessary to distinguish between pairwise and multiple comparison tests. We show that the pairwise Wilcoxon test, when employed to multiple comparisons, will lead to overoptimistic conclusions. We carry out intensive normality examination employing ten different tests showing...
Václav Soukup (1979)
Kybernetika
Similarity:
Wenhai Chen, Lixin Gao, Xiaole Xu, Bingbing Xu (2015)
Kybernetika
Similarity:
In this paper, we investigate multi-agent consensus problem with discrete-time linear dynamics under directed interaction topology. By assumption that all agents can only access the measured outputs of its neighbor agents and itself, a kind of distributed reduced-order observer-based protocols are proposed to solve the consensus problem. A multi-step algorithm is provided to construct the gain matrices involved in the protocols. By using of graph theory, modified discrete-time algebraic...
Guojun Gan, Emiliano A. Valdez (2017)
Dependence Modeling
Similarity:
Metamodeling techniques have recently been proposed to address the computational issues related to the valuation of large portfolios of variable annuity contracts. However, it is extremely diffcult, if not impossible, for researchers to obtain real datasets frominsurance companies in order to test their metamodeling techniques on such real datasets and publish the results in academic journals. To facilitate the development and dissemination of research related to the effcient valuation...