Zobrazeno 1 - 10
of 77
pro vyhledávání: '"hypergraphes"'
Autor:
Grouès, Lucien
Publikováno v:
Quantum Physics [quant-ph]. Sorbonne Université, 2022. English. ⟨NNT : 2022SORUS413⟩
To be able to perform useful computations employing quantum computers we need to make quantum information more robust against noise. One promising approach is to protect the information using quantum LDPC codes, however they are useless without a pow
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::b4527160cdec4bec7558b28a260a3359
https://theses.hal.science/tel-04018968
https://theses.hal.science/tel-04018968
Autor:
Ta, Duy Hoang
Publikováno v:
Information Theory [cs.IT]. Université de Lyon, 2022. English. ⟨NNT : 2022LYSEN024⟩
Understanding the properties of objects under a natural product operation is a central theme in mathematics, computer science and physics. Examples of such basic objects include noisy communication channels in information theory, computational proble
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::bd99a8e65163fb660a530b77d04b3f98
https://theses.hal.science/tel-03735720
https://theses.hal.science/tel-03735720
Autor:
Lizotte, Simon
La science des réseaux est notamment à la recherche de modèles mathématiques capables de reproduire le comportement de systèmes complexes empiriques. Cependant, la représentation usuelle, le graphe, est parfois inadéquate étant donné sa limi
Externí odkaz:
https://hdl.handle.net/20.500.11794/107424
Autor:
Trolliet, Thibaud
Publikováno v:
Social and Information Networks [cs.SI]. Université Côte d'Azur, 2021. English. ⟨NNT : 2021COAZ4048⟩
The rapid emergence of social networks, their major impact on today's society, and the recent access to large amounts of data about them has led to a strong interest in the study of complex networks in last decades. Many random graph models have been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ef8cab50f2516ebf6e997ce5861a32a7
https://tel.archives-ouvertes.fr/tel-03468769
https://tel.archives-ouvertes.fr/tel-03468769
Publikováno v:
[Research Report] RR-9390, Inria Grenoble Rhône-Alpes. 2021, pp.21
[Research Report] RR-9390, Inria Grenoble Rhône-Alpes. 2021, pp.25
[Research Report] RR-9390, Inria Grenoble Rhône-Alpes. 2021, pp.25
Revised version May 2021; We consider the problem of querying the existence of hyperedges in hypergraphs. More formally, we are given a hypergraph, and we need to answer queries of the form "does the following set of vertices form a hyperedge in the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::4a5402cd569b29f5527548764c0af659
https://hal.inria.fr/hal-03127673v2/file/RR-9390.pdf
https://hal.inria.fr/hal-03127673v2/file/RR-9390.pdf
Autor:
Mimouni, Mohamed
In this paper, I propose an algorithm capable of solving the problem of isomorphic graphs in polynomial time. First, I define a pseudo-tree that allows us to define for each vertex a label or a label. In the second place, I apply the pseudo-tree for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::c9497beff47cffe8131de4fa521902ad
https://hal.archives-ouvertes.fr/hal-01822100v5/file/version_anglais.pdf
https://hal.archives-ouvertes.fr/hal-01822100v5/file/version_anglais.pdf
Autor:
Nguyen, Thi Viet Ha
Publikováno v:
Combinatorics [math.CO]. Université Côte d'Azur, 2021. English. ⟨NNT : 2021COAZ4107⟩
To explain the biological function of a molecular assembly (MA), one has toknow its structural description. It may be ascribed to two levels of resolution: low resolution (i.e. molecular interactions) and high resolution (i.e. relative position and o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2570955cad8c2b43ed7b0d88ecc6cab2
https://theses.hal.science/tel-03647952
https://theses.hal.science/tel-03647952
Autor:
Ziska, Irene
Publikováno v:
Bioinformatics [q-bio.QM]. Université Claude Bernard Lyon 1 (UCBL), 2020. English. ⟨NNT : ⟩
Bioinformatics [q-bio.QM]. Université Claude Bernard Lyon 1 (UCBL), 2020. English
Bioinformatics [q-bio.QM]. Université Claude Bernard Lyon 1 (UCBL), 2020. English
In this thesis, I worked on two different constraint-based approaches to study the metabolism of microorganisms. The first method identifies knockouts that increase the production of a target chemical in a microorganism in the scenario where the prod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::99371198b261551db211fa9114619213
https://theses.hal.science/tel-03131655/file/Ziska_Thesis.pdf
https://theses.hal.science/tel-03131655/file/Ziska_Thesis.pdf
Autor:
Panagiotas, Ioannis
Publikováno v:
Data Structures and Algorithms [cs.DS]. Université de Lyon, 2020. English. ⟨NNT : 2020LYSEN068⟩
This thesis investigates four different and related problems that arise in the area of Combinatorial Scientific Computing (CSC). The connecting link between the four examined problems is the fundamental problem of matching, which asks for the largest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::fbec012ffd9eb8a4bd970ca3d374353a
https://tel.archives-ouvertes.fr/tel-03011794/file/PANAGIOTAS_Ioannis_2020LYSEN068_These.pdf
https://tel.archives-ouvertes.fr/tel-03011794/file/PANAGIOTAS_Ioannis_2020LYSEN068_These.pdf
Publikováno v:
ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications
ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
ALGOTEL 2020 – 22èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Sep 2020, Lyon, France
International audience; Let G be a graph and H a hypergraph with the same set of vertices and let F be a fixed graph. The graph GF overlays a hyperedge S of H if F is a covering subgraph of the subgraph of G induced by S. The graph GF-overlayin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______212::5a2581b5c0eb48ba199f23c69ee8b43c
https://hal.archives-ouvertes.fr/hal-02796730
https://hal.archives-ouvertes.fr/hal-02796730