Zobrazeno 1 - 10
of 108
pro vyhledávání: '"Genevès, Pierre"'
Recursive graph queries are increasingly popular for extracting information from interconnected data found in various domains such as social networks, life sciences, and business analytics. Graph data often come with schema information that describe
Externí odkaz:
http://arxiv.org/abs/2403.01863
Query optimizers built on the transformation-based Volcano/Cascades framework are used in many database systems. Transformations proposed earlier on the logical query dag (LQDAG) data structure, which is key in such a framework, focus only on recursi
Externí odkaz:
http://arxiv.org/abs/2312.02572
Big data programming frameworks have become increasingly important for the development of applications for which performance and scalability are critical. In those complex frameworks, optimizing code by hand is hard and time-consuming, making automat
Externí odkaz:
http://arxiv.org/abs/2306.07690
Graph data is omnipresent and has a wide variety of applications, such as in natural science, social networks, or the semantic web. However, while being rich in information, graphs are often noisy and incomplete. As a result, graph completion tasks,
Externí odkaz:
http://arxiv.org/abs/2303.15487
We present a system called Dist-$\mu$-RA for the distributed evaluation of recursive graph queries. Dist-$\mu$-RA builds on the recursive relational algebra and extends it with evaluation plans suited for the distributed setting. The goal is to offer
Externí odkaz:
http://arxiv.org/abs/2111.12487
Federated learning becomes a prominent approach when different entities want to learn collaboratively a common model without sharing their training data. However, Federated learning has two main drawbacks. First, it is quite bandwidth inefficient as
Externí odkaz:
http://arxiv.org/abs/2103.00342
Federated Learning allows distributed entities to train a common model collaboratively without sharing their own data. Although it prevents data collection and aggregation by exchanging only parameter updates, it remains vulnerable to various inferen
Externí odkaz:
http://arxiv.org/abs/2011.05578
Autor:
Genevès, Pierre
Cette thèse présente les fondements théoriques et pratiques d'un système pour l'analyse statique de langages manipulant des documents et données XML. Le système s'appuie sur une logique temporelle de point fixe avec programmes inverses, dériv
Externí odkaz:
http://tel.archives-ouvertes.fr/tel-00133591
http://tel.archives-ouvertes.fr/docs/00/98/88/62/PDF/geneves-phd.pdf
http://tel.archives-ouvertes.fr/docs/00/98/88/62/PDF/geneves-phd.pdf
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on frameworks for reasoning about path expressions where node car
Externí odkaz:
http://arxiv.org/abs/1008.5073
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node cardinali
Externí odkaz:
http://arxiv.org/abs/1005.5623