Zobrazeno 1 - 10
of 339
pro vyhledávání: '"Informatique mathématique"'
Autor:
Frédéric Oblé, Olivier Caelen, Fabrizio Carcillo, Yann-Aël Le Borgne, Yacine Kessaci, Gianluca Bontempi
Publikováno v:
Information sciences
Supervised learning techniques are widely employed in credit card fraud detection, as they make use of the assumption that fraudulent patterns can be learned from an analysis of past transactions. The task becomes challenging, however, when it has to
Publikováno v:
European Journal of Operational Research
European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European Journal of Operational Research, Elsevier, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European journal of operational research
European Journal of Operational Research, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European Journal of Operational Research, Elsevier, 2021, ⟨10.1016/j.ejor.2020.07.001⟩
European journal of operational research
The line graph of a graph G has one node per each edge of G, two of them being adjacent only when the corresponding edges have a node of G in common. In this work, we consider the problem of finding the minimum number of edges to delete so that the r
Publikováno v:
Networks
Networks, 2021, ⟨10.1002/net.22003⟩
Networks, Wiley, 2021, ⟨10.1002/net.22003⟩
Networks, 2021, ⟨10.1002/net.22003⟩
Networks, Wiley, 2021, ⟨10.1002/net.22003⟩
We show that the feasibility of a booking in the European entry-exit gas market can be decided in polynomial time on single-cycle networks that are passive, i.e. do not contain controllable elements. The feasibility of a booking can be characterized
Publikováno v:
Journal of Mathematical Cryptology, 14 (1
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 25-38 (2020)
Journal of Mathematical Cryptology, Vol 14, Iss 1, Pp 25-38 (2020)
We initiate the study of a new class of polynomials which we call quasi-subfield polynomials. First, we show that this class of polynomials could lead to more efficient attacks for the elliptic curve discrete logarithm problem via the index calculus
Publikováno v:
Evolutionary computation, 28 (2
Bezerra, L C T, López-Ibáñez, M & Stützle, T 2020, ' Automatically Designing State-of-the-Art Multi-and Many-Objective Evolutionary Algorithms ', Evolutionary Computation, vol. 28, no. 2, pp. 195-226 . https://doi.org/10.1162/evco_a_00263
Bezerra, L C T, López-Ibáñez, M & Stützle, T 2020, ' Automatically Designing State-of-the-Art Multi-and Many-Objective Evolutionary Algorithms ', Evolutionary Computation, vol. 28, no. 2, pp. 195-226 . https://doi.org/10.1162/evco_a_00263
A recent comparison of well-established multiobjective evolutionary algorithms (MOEAs) has helped better identify the current state-of-the-art by considering (i) parameter tuning through automatic configuration, (ii) a wide range of different setups,
Publikováno v:
Graphs and combinatorics
Graphs and combinatorics, 36 (3
Graphs and combinatorics, 36 (3
We show that, unlike the Yao–Yao graph YY6, the Theta–Theta graph ΘΘ6 defined by six cones is a spanner for sets of points in convex position. We also show that, for sets of points in non-convex position, the spanning ratio of ΘΘ6 is unbounde
Publikováno v:
Computer speech & language, 59
The article concerns the interpretation of the principal components of the spectrogram of the speech signal and its application to the description of dysarthric speech. Each principal component is a linear combination of the frame spectra. We show th
Publikováno v:
Computers and Operations Research
Computers and Operations Research, Elsevier, 2022
Computers and Operations Research, 2022
Computers & operations research, 137
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
Computers and Operations Research, Elsevier, 2022
Computers and Operations Research, 2022
Computers & operations research, 137
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
We consider two covering variants of the network design problem. We are given a set of origin/destination pairs, called O/D pairs, and each such O/D pair is covered if there exists a path in the network from the origin to the destination whose length
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1857355b430bd2da9cedd8d0491fc2e6
Autor:
de Quehen, Victoria, Kutas, Péter, Leonardi, Chris, Martindale, Chloe, Panny, Lorenz, Petit, Christophe, Stange, Katherine K.E.
Publikováno v:
Lecture notes in computer science, 12827 LNCS
SIDH is a post-quantum key exchange algorithm based on the presumed difficulty of finding isogenies between supersingular elliptic curves. However, SIDH and related cryptosystems also reveal additional information: the restriction of a secret isogeny
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2101::4477803160f70c47113b7fa744d1c8ee
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332219
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332219
Publikováno v:
Lecture notes in computer science, 12804 LNCS
Trapdoor DDH groups are an appealing cryptographic primitive introduced by Dent–Galbraith (ANTS 2006), where DDH instances are hard to solve unless provided with additional information (i.e. a trapdoor). In this paper, we introduce a new trapdoor D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2101::9641116c29c469e197bb287a3b8e955b
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332255
http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/332255