Zobrazeno 1 - 10
of 189
pro vyhledávání: '"ACM: G.: Mathematics of Computing"'
Autor:
Cheng, Zheng, Méry, Dominique
We propose a static checker, based on the Laplace transform, for checking reference tracking system designs against their performance and safety requirements. It aims to filter out designs that have obvious requirement violations. This is to prevent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::94d25bd76295dfe2bd1d43919ed35d89
https://hal.science/hal-04152829
https://hal.science/hal-04152829
Autor:
de Perthuis, Paola, Pointcheval, David
Publikováno v:
Proceedings of the 29th ACM Conference on Computer and Communications Security (CCS '22)
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
ACM CCS-Computer and Communications Security 2022
ACM CCS-Computer and Communications Security 2022, Nov 2022, Los Angeles, United States
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security
ACM CCS-Computer and Communications Security 2022
ACM CCS-Computer and Communications Security 2022, Nov 2022, Los Angeles, United States
International audience; In this paper, we extend Inner-Product Functional Encryption (IPFE), where there is just a vector in the key and a vector in the single sender's ciphertext, to two-client ciphertexts. More precisely, in our two-client function
Publikováno v:
GandALF 2022-Games, Automata, Logics, and Formal Verification
GandALF 2022-Games, Automata, Logics, and Formal Verification, Sep 2022, Madrid, Spain. ⟨10.4204/EPTCS.370.12⟩
GandALF 2022-Games, Automata, Logics, and Formal Verification, Sep 2022, Madrid, Spain. ⟨10.4204/EPTCS.370.12⟩
A crucial question in analyzing a concurrent system is to determine its long-run behaviour, and in particular, whether there are irreversible choices in its evolution, leading into parts of the reachability space from which there is no return to othe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9ce8c8062b33a050e0bd1ee33699f71
https://inria.hal.science/hal-03773855/document
https://inria.hal.science/hal-03773855/document
Publikováno v:
Lecture Notes in Computer Science
SCN 2022-13th Conference on Cryptography and Security for Networks
SCN 2022-13th Conference on Cryptography and Security for Networks, Sep 2022, Amalfi, Italy. pp.663-686, ⟨10.1007/978-3-031-14791-3_29⟩
Lecture Notes in Computer Science ISBN: 9783031147906
SCN 2022-13th Conference on Cryptography and Security for Networks
SCN 2022-13th Conference on Cryptography and Security for Networks, Sep 2022, Amalfi, Italy. pp.663-686, ⟨10.1007/978-3-031-14791-3_29⟩
Lecture Notes in Computer Science ISBN: 9783031147906
International audience; Oblivious Polynomial Evaluation (OPE) schemes are interactive protocols between a sender with a private polynomial and a receiver with a private evaluation point where the receiver learns the evaluation of the polynomial in th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6b9fa6a3132c7b44c87f175a90a629c
https://hal.science/hal-03820565/file/main.pdf
https://hal.science/hal-03820565/file/main.pdf
The possibility for one to recover the parameters-weights and biases-of a neural network thanks to the knowledge of its function on a subset of the input space can be, depending on the situation, a curse or a blessing. On one hand, recovering the par
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::21ce0fc5d9cb44afc9f772e2e0679a6e
https://hal.science/hal-03501784v1/document
https://hal.science/hal-03501784v1/document
Autor:
Khoshnoudirad, Daniel
The main goal of that paper is to show that the Syracuse Conjecture (also called Collatz Conjecture) is true.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b03afff816320a51988207298031bfd3
https://hal.archives-ouvertes.fr/hal-03463640
https://hal.archives-ouvertes.fr/hal-03463640
Autor:
Laurent Mertz, Olivier Pironneau
Publikováno v:
Computers & Mathematics with Applications
Computers & Mathematics with Applications, Elsevier, 2019, 78 (8), pp.2719-2733. ⟨10.1016/j.camwa.2019.04.013⟩
Computers & Mathematics with Applications, Elsevier, 2019, 78 (8), pp.2719-2733. ⟨10.1016/j.camwa.2019.04.013⟩
International audience; In this work, we propose a method to compute numerical approximations of the invariant measures and Rice's formula (frequency of threshold crossings) for a certain type of stochastic Hamiltonian system constrained by an obstac
Publikováno v:
Theoretical Computer Science
Theoretical Computer Science, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, Elsevier, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
Theoretical Computer Science, Elsevier, 2019, 777, pp.204-231. ⟨10.1016/j.tcs.2019.01.029⟩
International audience; We are interested in a natural generalization of term-rewriting techniques to what we call drags, viz. finite, directed, ordered, rooted multigraphs, each vertex of which is labeled by a function symbol. To this end, we develo
Autor:
Abderrahim Benslimane, Shao-Yu Lien, Alexey Vinel, Yen-Chih Kuo, Der-Jiunn Deng, Hua-Lung Tsai
Publikováno v:
IEEE Access, Vol 7, Pp 6782-6795 (2019)
IEEE Access
IEEE Access, IEEE, 2019, 7, pp.6782-6795. ⟨10.1109/ACCESS.2018.2888868⟩
IEEE Access
IEEE Access, IEEE, 2019, 7, pp.6782-6795. ⟨10.1109/ACCESS.2018.2888868⟩
International audience; With the facilitation of the fifth generation new radio, vehicle-to-everything applications have entered a brand new era to sustain the next generation driving use cases of advanced driving, vehicle pla-tooning, extended senso