Graph Exploration is a problem motivated by several aspects of theoretical computer science, including logic and computational complexity. It has also numerous applications in robotics. In all these contexts, the amount of memory used by the mobile entity (robot, finite automaton, etc.) performing exploration is a key parameter. In this thesis, we study in depth the space complexity of graph ex...

Marion Dohen, Amélie Rochet-Capellan, Coriandre Vilain, Benjamin Roustan, Rafael Laboissière & Jean-Luc Schwartz Speech & Cognition Department, GIPSA-lab, France 2 Motor Control Lab, McGill University, Canada 3 INSERM, U864, Espace et Action, France 4 Max Planck Institute for Human Cognitive and Brain Sciences, Germany [email protected]; [email protected]; coriandre.vilain@gi...

Abstract In this work, we are interested in a non symmetric homogeneous space, namely SO(2m)/Sp(m). We show that this space admits a structure of (Z2) -symmetric space. We describe all the non degenerated metrics and classify the Riemannian and Lorentzian ones. Dans ce travail, nous nous intéressons à un espace homogène non symétrique, à savoir SO(2m)/Sp(m). Nous montrons que cet espace admet u...

The aims of this research residency were to test and evaluate the practical, perceptual and compositional use of higher order ambisonics. The work explored three main technical areas: very high order synthesised ambisonics sound-fields in 2D up to 12 order and 3D up to 9 order, near-field compensated higher order ambisonics and higher-order recorded sound-fields using the EigenMike. The followi...

This paper presents an exploration of a lexical graph, within the framework of lexical semantics. The aim of the exploration is reveal the structure of the lexicon modelled by the graph so an automatic system can reach the information it contains. We developed geometric tools to build a semantic space associated with the graph. The topology of this space can account for the topology of the grap...