![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp for Publications
export results for "Matthieu Canaud"
@article{DBLP:journals/nhm/CanaudMSF13, author = {Matthieu Canaud and Lyudmila Mihaylova and Jacques Sau and Nour{-}Eddin El Faouzi}, title = {Probability hypothesis density filtering for real-time traffic state estimation and prediction}, journal = {Networks Heterog. Media}, volume = {8}, number = {3}, pages = {825--842}, year = {2013}, url = {https://doi.org/10.3934/nhm.2013.8.825}, doi = {10.3934/NHM.2013.8.825}, timestamp = {Thu, 16 Apr 2020 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/nhm/CanaudMSF13.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@inproceedings{DBLP:conf/sdf/CanaudMFBS12, author = {Matthieu Canaud and Lyudmila Mihaylova and Nour{-}Eddin El Faouzi and Romain Billot and Jacques Sau}, title = {A probabilistic hypothesis density filter for traffic flow estimation in the presence of clutter}, booktitle = {Workshop on Sensor Data Fusion: Trends, Solutions, Applications, {SDF} 2012, Bonn, Germany, September 4-6, 2012}, pages = {31--36}, publisher = {{IEEE}}, year = {2012}, url = {https://doi.org/10.1109/SDF.2012.6327904}, doi = {10.1109/SDF.2012.6327904}, timestamp = {Wed, 16 Oct 2019 14:14:54 +0200}, biburl = {https://dblp.org/rec/conf/sdf/CanaudMFBS12.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.