Zobrazeno 1 - 10
of 22
pro vyhledávání: '"Groz, Benoît"'
We study the problem of finding, in a directed graph, an st-walk of length r mod q which is edge-minimum, i.e., uses the smallest number of distinct edges. Despite the vast literature on paths and cycles with modularity constraints, to the best of ou
Externí odkaz:
http://arxiv.org/abs/2412.01614
Publikováno v:
Symposium on Principles of Database Systems, Jun 2023, Seattle, United States
We investigate graph transformations, defined using Datalog-like rules based on acyclic conjunctive two-way regular path queries (acyclic C2RPQs), and we study two fundamental static analysis problems: type checking and equivalence of transformations
Externí odkaz:
http://arxiv.org/abs/2304.05070
We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is both sou
Externí odkaz:
http://arxiv.org/abs/2107.04891
Given a set of $n$ points in a $d$-dimensional space, we seek to compute the skyline, i.e., those points that are not strictly dominated by any other point, using few comparisons between elements. We adopt the noisy comparison model [FRPU94] where co
Externí odkaz:
http://arxiv.org/abs/1710.02058
Autor:
Groz, Benoît
Les évolutions technologiques ont consacré l'émergence des services web et du stockage des données en ligne, en complément des bases de données traditionnelles. Ces évolutions facilitent l'accès aux données, mais en contrepartie soulèvent d
Externí odkaz:
http://www.theses.fr/2012LIL10143/document
Publikováno v:
In Journal of Computer and System Sciences March 2020 108:29-48
Regular path queries (RPQs) select nodes connected by some path in a graph. The edge labels of such a path have to form a word that matches a given regular expression. We investigate the evaluation of RPQs with an additional constraint that prevents
Externí odkaz:
http://arxiv.org/abs/1212.6857
Publikováno v:
In Information and Computation November 2014 238:2-29
Publikováno v:
International Conference on Database Theory
International Conference on Database Theory, 2022, Edinbourgh, United Kingdom. ⟨10.4230/LIPIcs.ICDT.2022.7⟩
International Conference on Database Theory, 2022, Edinbourgh, United Kingdom. ⟨10.4230/LIPIcs.ICDT.2022.7⟩
International audience; We investigate the problem of constructing a shape graph that describes the structure of a given graph database. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that is b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::ba85b930b0d6f6ce2a608c5e12afe74a
https://inria.hal.science/hal-03559309/document
https://inria.hal.science/hal-03559309/document
Autor:
Groz, Benoît1 (AUTHOR) benoit.groz@lri.fr, Maniu, Silviu1 (AUTHOR) silviu.maniu@lri.fr
Publikováno v:
Evolutionary Computation. Winter2019, Vol. 27 Issue 4, p611-637. 27p.