Zobrazeno 1 - 10
of 960
pro vyhledávání: '"Informatique mathématique"'
Autor:
Labbé, Sébastien, Penelle, Vincent, Mishna, Marni, Johansson, Fredrik, Bonamy, Marthe, Leroux, Jérôme, Goaoc, Xavier, Penev, Irena, Schmitz, Sylvain, Caruso, Xavier
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::9da97bbbe29b9cf01b05e9c8ffc5a95c
https://hal.archives-ouvertes.fr/hal-03431823
https://hal.archives-ouvertes.fr/hal-03431823
Autor:
Salvy, Bruno
Publikováno v:
France. CNRS éditions, pp.1-258, 2017, 978-2-271-11523-2
CNRS éditions, pp.1-258, 2017, 978-2-271-11523-2
CNRS éditions, pp.1-258, 2017, 978-2-271-11523-2
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::30aec78ad42ae17916cb26acd3e40553
https://hal.inria.fr/hal-01658949
https://hal.inria.fr/hal-01658949
Autor:
Ollinger, Nicolas
Publikováno v:
École Jeunes Chercheurs en Informatique Mathématique
École Jeunes Chercheurs en Informatique Mathématique, Mar 2015, Orléans, France. CNRS Éditions, 2015, CNRS Alpha, 978-2-271-08791-1
École Jeunes Chercheurs en Informatique Mathématique, Mar 2015, Orléans, France. CNRS Éditions, 2015, CNRS Alpha, 978-2-271-08791-1
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::350286f381c30d61becd99e5e59db816
https://hal.archives-ouvertes.fr/hal-01294133
https://hal.archives-ouvertes.fr/hal-01294133
Autor:
Langlois, Philippe
Publikováno v:
Philippe Langlois. France. Première édition, Presses Universitaires de Perpignan, pp.283, 2013, Etudes, 9782354121839
National audience; Cet ouvrage rassemble les cours proposés lors de l'édition 2013 de l'Ecole des jeunes chercheurs en informatique mathématique qui s'est tenue à Perpignan en avril 2013. L'informatique mathématique regroupe des thématiques rel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::867ffb9133d6796f47402ac9e0882563
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00835506
https://hal-lirmm.ccsd.cnrs.fr/lirmm-00835506
Publikováno v:
Économie, mathématique et histoire, Hommage à Christian Bidard
Économie, mathématique et histoire, Hommage à Christian Bidard, Presse Universitaire de Paris Ouest, pp.189-204, 2014
BASE-Bielefeld Academic Search Engine
Économie, mathématique et histoire, Hommage à Christian Bidard, Presse Universitaire de Paris Ouest, pp.189-204, 2014
BASE-Bielefeld Academic Search Engine
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::331c52edb041fac34772d53cee088c94
https://hal.archives-ouvertes.fr/hal-01221744
https://hal.archives-ouvertes.fr/hal-01221744
Autor:
Peyronnet, Sylvain
Publikováno v:
France. 2014, 9782354122287
National audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d34c437daaee64927fce4ad5db45cd7c
https://hal.archives-ouvertes.fr/hal-01146360
https://hal.archives-ouvertes.fr/hal-01146360
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::278fe9b00427b3a432f839b70ddaf243
https://doi.org/10.1016/j.ins.2019.05.042
https://doi.org/10.1016/j.ins.2019.05.042
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::75c8af2662b551c39d44d23327fa0b75
https://doi.org/10.1016/j.ejor.2020.07.001
https://doi.org/10.1016/j.ejor.2020.07.001
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0063978a1344a3ce6ffad278b313bf0b
https://doi.org/10.1002/net.22003
https://doi.org/10.1002/net.22003
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
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f6b9481adf0c4a125692c94f9386642
https://doi.org/10.1515/jmc-2015-0049
https://doi.org/10.1515/jmc-2015-0049