Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Maignan, Aude"'
We consider the private set union (PSU) problem, where two parties each hold a private set of elements, and they want one of the parties (the receiver) to learn the union of the two sets and nothing else. Our protocols are targeted for the unbalanced
Externí odkaz:
http://arxiv.org/abs/2402.16393
Autor:
Cousin, Paul, Maignan, Aude
Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. This work introduces linear algebra based tools that allow for a practical investigation of their behavior in deeply extend
Externí odkaz:
http://arxiv.org/abs/2211.13619
Publikováno v:
Privacy Enhancing Technologies Symposium, Jul 2023, Lausanne (CH), Switzerland
Proofs of Retrievability are protocols which allow a Client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. Dynamic Proofs of Retrievability (DPoR) also support efficient retrieval and upd
Externí odkaz:
http://arxiv.org/abs/2110.02022
Autor:
Anthoine, Gaspard, Dumas, Jean-Guillaume, Hanling, Michael, de Jonghe, Mélanie, Maignan, Aude, Pernet, Clément, Roche, Daniel
Proofs of Retrievability (PoRs) are protocols which allow a client to store data remotely and to efficiently ensure, via audits, that the entirety of that data is still intact. A dynamic PoR system also supports efficient retrieval and update of any
Externí odkaz:
http://arxiv.org/abs/2007.12556
Autor:
Echahed, Rachid, Maignan, Aude
We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which transform d
Externí odkaz:
http://arxiv.org/abs/1701.06790
Autor:
Eppstein, David, Kindermann, Philipp, Kobourov, Stephen, Liotta, Giuseppe, Lubiw, Anna, Maignan, Aude, Mondal, Debajyoti, Vosoughpour, Hamideh, Whitesides, Sue, Wismath, Stephen
Publikováno v:
Algorithmica 80 (3): 977-994 (special issue for LATIN), 2018
Motivated by applications in graph drawing and information visualization, we examine the planar split thickness of a graph, that is, the smallest $k$ such that the graph is $k$-splittable into a planar graph. A $k$-split operation substitutes a verte
Externí odkaz:
http://arxiv.org/abs/1512.04839
Keiper and Li published independent investigations of the connection between the Riemann hypothesis and the properties of sums over powers of zeros of the Riemann zeta function. Here we comment on these papers, and propose some extensions of their re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0991c5ae9af523021f1b65a27b57a945
https://hal.science/hal-03579652/file/CommentsExtensions-HAL.pdf
https://hal.science/hal-03579652/file/CommentsExtensions-HAL.pdf
Autor:
Maignan, Aude, Scott, Tony
Publikováno v:
International Conference on Machine Learning Techniques and Data Science (MLDS)
International Conference on Machine Learning Techniques and Data Science (MLDS), Dec 2020, Sydney, Australia
International Conference on Machine Learning Techniques and Data Science (MLDS), Dec 2020, Sydney, Australia
International audience; Quantum clustering (QC), is a data clustering algorithm based on quantum mechanics which is accomplished by substituting each point in a given dataset with a Gaussian. The width of the Gaussian is a value, a hyper-parameter wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4207704c00152dbd546c6e669b93fd56
https://hal.archives-ouvertes.fr/hal-03169118
https://hal.archives-ouvertes.fr/hal-03169118
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.