963 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- Institut national de recherche en sciences et technologies du numériqueFR300 papers
- Université de LorraineFR277 papers
- Centre National de la Recherche ScientifiqueFR269 papers
- Centre Inria de l'Université de LorraineFR87 papers
- Sorbonne UniversitéFR26 papers
- Institut Élie Cartan de LorraineFR19 papers
- Université Paris-SaclayFR18 papers
- MOCQUA: Modèles de calcul émergentsFR17 papers
- Laboratoire d'Informatique de Paris-NordFR16 papers
- Université Sorbonne Paris NordFR16 papers
- Institut de Recherche en Informatique de ToulouseFR13 papers
- National Institute of InformaticsJP13 papers
60 papers · 1 filter
The Impact of VAE Design on Latent Pose Representations for Diffusion-based Sign Language Production
Guilhem Fauré, Mostafa Sadeghi, Sam Bigeard +1
Latent diffusion approaches to sign language production (SLP) rely on an initial stage that learns an encoding of sign pose sequences, enabling generative modeling in the resulting…
Projecting Latent RL Actions: Towards Generalizable and Scalable Graph Combinatorial Optimization
Franco Terranova, Guillermo Bernardez, Albert Cabellos-Aparicio +2
Graph combinatorial optimization (GCO) has attracted growing interest, as many NP-hard problems naturally admit graph formulations, yet their combinatorial explosion renders exact…
Towards Ontology-Based Descriptions of Conversations with Qualitatively-Defined Concepts
Barbara Gendron, Gaël Guibon, Mathieu D'aquin
The controllability of Large Language Models (LLMs) when used as conversational agents is a key challenge, particularly to ensure predictable and user-personalized responses. This…
Automatic Tongue Delineation from MRI Images with a Convolutional Neural Network Approach
Karyna Isaieva, Yves Laprie, Nicolas Turpault +3
Tongue contour extraction from real-time magnetic resonance images is a nontrivial task due to the presence of artifacts manifesting in form of blurring or ghostly contours. In thi…
KGPrune: a Web Application to Extract Subgraphs of Interest from Wikidata with Analogical Pruning
Pierre Monnin, Cherif-Hassan Nousradine, Lucas Jarnac +2
Knowledge graphs (KGs) have become ubiquitous publicly available knowledge sources, and are nowadays covering an ever increasing array of domains. However, not all knowledge repres…
Ontological Relations from Word Embeddings
Mathieu d'Aquin, Emmanuel Nauer
It has been reliably shown that the similarity of word embeddings obtained from popular neural models such as BERT approximates effectively a form of semantic similarity of the mea…
Finding Concept Representations in Neural Networks with Self-Organizing Maps
Mathieu d'Aquin
In sufficiently complex tasks, it is expected that as a side effect of learning to solve a problem, a neural network will learn relevant abstractions of the representation of that…
Relevant Entity Selection: Knowledge Graph Bootstrapping via Zero-Shot Analogical Pruning
Lucas Jarnac, Miguel Couceiro, Pierre Monnin
Knowledge Graph Construction (KGC) can be seen as an iterative process starting from a high quality nucleus that is refined by knowledge extraction approaches in a virtuous loop. S…
How much of UCCA can be predicted from AMR?
Siyana Pavlova, Maxime Amblard, Bruno Guillaume
In this paper, we consider two of the currently popular semantic frameworks: Abstract Meaning Representation (AMR)a more abstract framework, and Universal Conceptual Cognitive Anno…
Graph Querying for Semantic Annotations
Maxime Amblard, Bruno Guillaume, Siyana Pavlova +1
This paper presents how the online tool GREW-MATCH can be used to make queries and visualise data from existing semantically annotated corpora. A dedicated syntax is available to c…
Knowledge-Based Matching of -ary Tuples
Pierre Monnin, Miguel Couceiro, Amedeo Napoli +1
An increasing number of data and knowledge sources are accessible by human and software agents in the expanding Semantic Web. Sources may differ in granularity or completeness, and…
Generating Interactive Worlds with Text
Angela Fan, Jack Urbanek, Pratik Ringshia +8
Procedurally generating cohesive and interesting game environments is challenging and time-consuming. In order for the relationships between the game elements to be natural, common…
AI in the media and creative industries
Giuseppe Amato, Malte Behrmann, Frédéric Bimbot +16
Thanks to the Big Data revolution and increasing computing capacities, Artificial Intelligence (AI) has made an impressive revival over the past few years and is now omnipresent in…
Micro-Data Learning: The Other End of the Spectrum
Jean-Baptiste Mouret
Many fields are now snowed under with an avalanche of data, which raises considerable challenges for computer scientists. Meanwhile, robotics (among other fields) can often only us…
True Lies
Thomas Ågotnes, Hans van Ditmarsch, Yanjing Wang
A true lie is a lie that becomes true when announced. In a logic of announcements, where the announcing agent is not modelled, a true lie is a formula (that is false and) that beco…
Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
Aleksey Buzmakov, Sergei O. Kuznetsov, Amedeo Napoli
In pattern mining, the main challenge is the exponential explosion of the set of patterns. Typically, to solve this problem, a constraint for pattern selection is introduced. One o…
Bisimulation and expressivity for conditional belief, degrees of belief, and safe belief
Mikkel Birkegaard Andersen, Thomas Bolander, Hans van Ditmarsch +1
Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of c…
On mining complex sequential data by means of FCA and pattern structures
Aleksey Buzmakov, Elias Egho, Nicolas Jay +3
Nowadays data sets are available in very complex and heterogeneous ways. Mining of such data collections is essential to support many real-world applications ranging from healthcar…
Comparison of Selection Methods in On-line Distributed Evolutionary Robotics
Iñaki Fernández Pérez, Amine Boumaza, François Charpillet
In this paper, we study the impact of selection methods in the context of on-line on-board distributed evolutionary algorithms. We propose a variant of the mEDEA algorithm in which…
Belief revision in the propositional closure of a qualitative algebra
Valmi Dufour-Lussier, Alice Hermann, Florence Le Ber +1
Belief revision is an operation that aims at modifying old be-liefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalism…
Approximate Policy Iteration Schemes: A Comparison
Bruno Scherrer
We consider the infinite-horizon discounted optimal control problem formalized by Markov Decision Processes. We focus on several approximate variations of the Policy Iteration algo…
Belief revision in the propositional closure of a qualitative algebra (extended version)
Valmi Dufour-Lussier, Alice Hermann, Florence Le Ber +1
Belief revision is an operation that aims at modifying old beliefs so that they become consistent with new ones. The issue of belief revision has been studied in various formalisms…
An Investigation into Mathematical Programming for Finite Horizon Decentralized POMDPs
Raghav Aras, Alain Dutech
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Partia…
Case Adaptation with Qualitative Algebras
Valmi Dufour-Lussier, Florence Le Ber, Jean Lieber +1
This paper proposes an approach for the adaptation of spatial or temporal cases in a case-based reasoning system. Qualitative algebras are used as spatial and temporal knowledge re…