A structured prediction approach for robot imitation learning
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
We propose here some basic approaches to direct processing of the 360o-images as we take into consideration the geometry of each one. Obviously, the geometry of each of these images is a consequence of the geometry of the sensor's mirror used. This tech ...
The use of chemical nanopatterns through nanoimprint lithography ato align a nematic liquid crystal (LC) in LC cells was described. It was found that the ratio of areas with different surface-aligning helped in the polar orientation of LC, while the azimut ...
We present an accurate and self-consistent technique for computing the electromagnetic held in scattering structures formed by bodies embedded in a stratified background and extending infinitely in one direction (two-dimensional geometry), With this fully ...
Bone is a natural composite construct, with a gradient structure going from a loose interconnected cellular core to an outer dense wall, thus minimizing bone weight while keeping a high mechanical resistance. Due to this unique and complex structure, bone ...
Over the past few years, genes involved in the ontogenesis of tetrapod limbs have been isolated and characterized. Some of the developmental mechanisms responsible for the morphogenesis of these complex structures can now be investigated through a new appr ...
We study two encodings of the asynchronous pi-calculus with input-guarded choice into its choice-free fragment. One encoding is divergence-free, but refines the atomic commitment of choice into gradual commitment. The other preserves atomicity, but introdu ...
We study obstructions for a quasi-regular mapping f : M -> N of finite degree between Riemannian manifolds to blow up on or collapse on a non-trivial part of the boundary of M. ...
Summary: We present a method based on an optimal control technique for numerical computations of geodesic paths between two fixed points of a Riemannian manifold under the assumption of existence. In this method, the control variable is the tangent vector ...
We obtain Liouville type theorems for mappings with bounded s-distorsion between Riemannian manifolds. Besides these mappings, we introduce and study a new class, which we call mappings with bounded q-codistorsion. ...
