Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Olivier J. J. Michel

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Barbara Nicolas

> Home > Persons > Olivier J. J. Michel

Publications

2013
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/sigpro/CarmonaMLSN13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/sigpro/CarmonaMLSN13
Mikael Carmona, Olivier J. J. Michel, Jean-Louis Lacoume, Nathalie Sprynski, Barbara Nicolas:
An analytical solution for the complete sensor network attitude estimation problem. Signal Process. 93(4): 652-660 (2013)
2011
[c15]
- view
  - electronic edition @ ieee.org
  - no references & citations available
- export record
  dblp key:
  - conf/eusipco/CarmonaMLNS11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/eusipco/CarmonaMLNS11
Mikael Carmona, Olivier J. J. Michel, Jean-Louis Lacoume, Barbara Nicolas, Nathalie Sprynski:
Passive identification of acoustic propagation media with viscous damping. EUSIPCO 2011: 1155-1159
[i3]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1104-1317
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1104-1317
Mikael Carmona, Olivier J. J. Michel, Jean-Louis Lacoume, Nathalie Sprynski, Barbara Nicolas:
Algorithm for Sensor Network Attitude Problem. CoRR abs/1104.1317 (2011)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.