Zobrazeno 1 - 10
of 2 644
pro vyhledávání: '"Zeitoun, P."'
Autor:
Bousquet, Nicolas, Zeitoun, Sébastien
In local certification, vertices of a $n$-vertex graph perform a local verification to check if a given property is satisfied by the graph. This verification is performed thanks to certificates, which are pieces of information that are given to the v
Externí odkaz:
http://arxiv.org/abs/2410.14658
Autor:
Wu, Chaoneng, Xu, Yiming, Kalouguine, Andre, Kaur, Jaismenn, Cavagna, Antoine, Liu, Zuoye, Lopez-Martens, Rodrigo, Zhou, Cangtao, Zeitoun, Philippe, Haessler, Stefan, Li, Lu
The use of tunable pre-pulse is a common technique to enhance the high-order harmonic generation from surface plasma. The shape and dynamic of the electron density, the degree of ionization and its rate, and the plasma heating are influenced by the p
Externí odkaz:
http://arxiv.org/abs/2410.09752
Local certification is the area of distributed network computing asking the following question: How to certify to the nodes of a network that a global property holds, if they are limited to a local verification? In this area, it is often essential to
Externí odkaz:
http://arxiv.org/abs/2409.15404
When the world changes, so does the text that humans write about it. How do we build language models that can be easily updated to reflect these changes? One popular approach is retrieval-augmented generation, in which new documents are inserted into
Externí odkaz:
http://arxiv.org/abs/2406.11830
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a l
Externí odkaz:
http://arxiv.org/abs/2402.12148
Autor:
Place, Thomas, Zeitoun, Marc
We classify the regular languages using an operator $\mathcal{C}\mapsto TL(\mathcal{C})$. For each input class of languages $\mathcal{C}$, it builds a larger class $TL(\mathcal{C})$ consisting of all languages definable in a variant of unary temporal
Externí odkaz:
http://arxiv.org/abs/2402.10080
In this work, we provide an upper bound for global certification of graph homomorphism, a generalization of graph coloring. In certification, the nodes of a network should decide if the network satisfies a given property, thanks to small pieces of in
Externí odkaz:
http://arxiv.org/abs/2402.03849
Autor:
Place, Thomas, Zeitoun, Marc
We look at concatenation hierarchies of classes of regular languages. Each such hierarchy is determined by a single class, its basis: level $n$ is built by applying the Boolean polynomial closure operator (BPol), $n$ times to the basis. A prominent a
Externí odkaz:
http://arxiv.org/abs/2401.16195
By twisting the spectral triple of a riemannian spin manifold, we show how to generate an orthogonal and geodesic preserving torsion from a torsionless Dirac operator. We identify the group of twisted unitaries as the generator of torsion with co-exa
Externí odkaz:
http://arxiv.org/abs/2401.07848
Local certification is a distributed mechanism enabling the nodes of a network to check the correctness of the current configuration, thanks to small pieces of information called certificates. For many classic global properties, like checking the acy
Externí odkaz:
http://arxiv.org/abs/2312.13702