default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrançois Desbouvries
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Elouan Argouarc'h
, François Desbouvries:
Binary Classification Based Monte Carlo Simulation. IEEE Signal Process. Lett. 31: 1449-1453 (2024)- [i3]Elouan Argouarc'h, François Desbouvries, Eric Barat, Eiji Kawasaki:
Generative vs. Discriminative modeling under the lens of uncertainty quantification. CoRR abs/2406.09172 (2024) - 2023
- [j25]François Desbouvries, Yohan Petetin, Achille Salaün:
Expressivity of Hidden Markov Chains vs. Recurrent Neural Networks From a System Theoretic Viewpoint. IEEE Trans. Signal Process. 71: 4178-4191 (2023) - 2022
- [i2]Elouan Argouarc'h, François Desbouvries, Eric Barat, Eiji Kawasaki, Thomas Dautremer:
Discretely Indexed Flows. CoRR abs/2204.01361 (2022) - [i1]François Desbouvries, Yohan Petetin, Achille Salaün:
Expressivity of Hidden Markov Chains vs. Recurrent Neural Networks from a system theoretic viewpoint. CoRR abs/2208.08175 (2022) - 2021
- [j24]Yohan Petetin, Yazid Janati, François Desbouvries:
Structured Variational Bayesian Inference for Gaussian State-Space Models With Regime Switching. IEEE Signal Process. Lett. 28: 1953-1957 (2021)
2010 – 2019
- 2019
- [c24]Achille Salaün, Yohan Petetin, François Desbouvries:
Comparing the Modeling Powers of RNN and HMM. ICMLA 2019: 1496-1499 - 2018
- [j23]Roland Lamberti, Yohan Petetin, François Desbouvries, François Septier:
Semi-Independent Resampling for Particle Filtering. IEEE Signal Process. Lett. 25(1): 130-134 (2018) - [c23]Roland Lamberti, Yohan Petetin, François Septier, François Desbouvries:
A Double Proposal Normalized Importance Sampling Estimator. SSP 2018: 238-242 - 2017
- [j22]Roland Lamberti, Yohan Petetin, François Desbouvries, François Septier:
Independent Resampling Sequential Monte Carlo Algorithms. IEEE Trans. Signal Process. 65(20): 5318-5333 (2017) - 2016
- [c22]Roland Lamberti, Yohan Petetin, François Septier, François Desbouvries:
Particle filters with independent resampling. ICASSP 2016: 3994-3998 - [c21]Roland Lamberti, Yohan Petetin, François Septier, François Desbouvries:
An improved SIR-based Sequential Monte Carlo algorithm. SSP 2016: 1-5 - 2015
- [j21]Yohan Petetin, François Desbouvries:
Bayesian Conditional Monte Carlo Algorithms for Nonlinear Time-Series State Estimation. IEEE Trans. Signal Process. 63(14): 3586-3598 (2015) - 2014
- [j20]Yohan Petetin, Mark R. Morelande, François Desbouvries:
Marginalized particle PHD filters for multiple object Bayesian filtering. IEEE Trans. Aerosp. Electron. Syst. 50(2): 1182-1196 (2014) - [j19]Noufel Abbassi, Stéphane Derrode, François Desbouvries, Yohan Petetin, Wojciech Pieczynski:
Filtrage statistique optimal rapide dans des systèmes linéaires à sauts non stationnaires. Traitement du Signal 31(3-4): 339-361 (2014) - [j18]Yohan Petetin, François Desbouvries:
A Class of Fast Exact Bayesian Filters in Dynamical Models With Jumps. IEEE Trans. Signal Process. 62(14): 3643-3653 (2014) - [c20]Yohan Petetin, François Desbouvries:
Exact Bayesian estimation in constrained Triplet Markov Chains. MLSP 2014: 1-6 - 2013
- [j17]Yohan Petetin, François Desbouvries:
Optimal SIR algorithm vs. fully adapted auxiliary particle filter: a non asymptotic analysis. Stat. Comput. 23(6): 759-775 (2013) - [j16]Yohan Petetin, François Desbouvries:
Bayesian Multi-Object Filtering for Pairwise Markov Chains. IEEE Trans. Signal Process. 61(18): 4481-4490 (2013) - 2012
- [c19]Yohan Petetin, François Desbouvries:
Multi-object filtering for pairwise Markov chains. ISSPA 2012: 348-353 - [c18]Yohan Petetin, François Desbouvries:
Marginalized PHD Filters for multi-target filtering. ISSPA 2012: 419-424 - [c17]Yohan Petetin, François Desbouvries:
A mixed GM/SMC implementation of the probability hypothesis density filter. ISSPA 2012: 425-430 - [c16]Yohan Petetin, François Desbouvries:
A semi-exact sequential Monte Carlo filtering algorithm in Hidden Markov Chains. ISSPA 2012: 595-600 - [c15]Yohan Petetin, François Desbouvries:
Further Rao-Blackwellizing an already Rao-Blackwellized algorithm for Jump Markov State Space Systems. ISSPA 2012: 706-711 - 2011
- [j15]François Desbouvries, Yohan Petetin, Boujemaa Ait-El-Fquih:
Direct, prediction- and smoothing-based Kalman and particle filter algorithms. Signal Process. 91(8): 2064-2077 (2011) - [j14]Boujemaa Ait-El-Fquih, François Desbouvries:
Fixed-Interval Kalman Smoothing Algorithms in Singular State-Space Systems. J. Signal Process. Syst. 65(3): 469-478 (2011) - [c14]François Desbouvries, Yohan Petetin, Emmanuel Monfrini:
Optimal SIR algorithm vs. fully adapted auxiliary particle filter: A matter of conditional independence. ICASSP 2011: 3992-3995 - 2010
- [j13]Alberto Gaspar Guimarães, Boujemaa Ait-El-Fquih, François Desbouvries:
A fixed-lag particle smoother for blind SISO equalization of time-varying channels. IEEE Trans. Wirel. Commun. 9(2): 512-516 (2010)
2000 – 2009
- 2008
- [j12]Boujemaa Ait-El-Fquih, François Desbouvries:
On Bayesian Fixed-Interval Smoothing Algorithms. IEEE Trans. Autom. Control. 53(10): 2437-2442 (2008) - [c13]Alberto Gaspar Guimarães, Boujemaa Ait-El-Fquih, François Desbouvries:
A fixed-lag particle smoothing algorithm for the blind turbo equalization of time-varying channels. ICASSP 2008: 2917-2920 - [c12]Boujemaa Ait-El-Fquih, François Desbouvries:
A new Particle Filtering algorithm with structurally optimal importance function. ICASSP 2008: 3413-3416 - 2006
- [j11]François Desbouvries, Jean Lecomte, Wojciech Pieczynski:
Kalman filtering in pairwise Markov trees. Signal Process. 86(5): 1049-1054 (2006) - [j10]Boujemaa Ait-El-Fquih, François Desbouvries:
Kalman Filtering in Triplet Markov Chains. IEEE Trans. Signal Process. 54(8): 2957-2963 (2006) - [c11]Boujemaa Ait-El-Fquih, François Desbouvries:
Unsupervised Signal Restoration in Partially Observed Markov Chains. ICASSP (3) 2006: 13-16 - 2005
- [j9]François Desbouvries, Jean Lecomte:
Multiscale Bayesian Restoration in Pairwise Markov Trees. IEEE Trans. Autom. Control. 50(8): 1185-1190 (2005) - [c10]Boujemaa Ait-El-Fquih, François Desbouvries:
Kalman filtering for triplet Markov chains: applications and extensions. ICASSP (4) 2005: 685-688 - 2004
- [c9]François Desbouvries, Jean Lecomte:
Multiscale Bayesian estimation in Pairwise Markov Trees. EUSIPCO 2004: 1437-1440 - 2003
- [j8]François Desbouvries:
Non-Euclidean geometrical aspects of the Schur and Levinson-Szego algorithms. IEEE Trans. Inf. Theory 49(8): 1992-2003 (2003) - [c8]Wojciech Pieczynski, François Desbouvries:
Kalman filtering using pairwise Gaussian models. ICASSP (6) 2003: 57-60 - [c7]François Desbouvries, Wojciech Pieczynski:
Particle filtering with pairwise Markov processes. ICASSP (6) 2003: 705-708 - 2002
- [j7]Walid Hachem, François Desbouvries, Philippe Loubaton:
MIMO channel blind identification in the presence of spatially correlated noise. IEEE Trans. Signal Process. 50(3): 651-661 (2002) - [c6]Wrya Muhammad, Emmanuele Grosicki, Karim Abed-Meraim, Jean Pierre Delmas, François Desbouvries:
Uplink versus Downlink wirless mobile positioning in UMTS cellular radio systems. EUSIPCO 2002: 1-4 - 2000
- [c5]Walid Hachem, François Desbouvries, Philippe Loubaton:
Blind channel estimation for CDMA systems: an induced cyclostationarity approach. ICASSP 2000: 2477-2480
1990 – 1999
- 1999
- [j6]François Desbouvries, Philippe Loubaton:
On the identification of certain rational transfer functions from truncated autocovariance sequences. IEEE Trans. Autom. Control. 44(5): 1078-1081 (1999) - 1998
- [j5]Antoine Chevreuil, François Desbouvries, Alexei Gorokhov, Philippe Loubaton, Christophe Vignat:
Blind equalization in the presence of jammers and unknown noise: solutions based on second-order cyclostationary statistics. IEEE Trans. Signal Process. 46(1): 259-263 (1998) - 1997
- [j4]François Desbouvries, Phillip A. Regalia:
A minimal, rotation-based FRLS lattice algorithm. IEEE Trans. Signal Process. 45(5): 1371-1374 (1997) - 1996
- [j3]François Desbouvries, Inbar Fijalkow, Philippe Loubaton:
On the identification of noisy MA models. IEEE Trans. Autom. Control. 41(12): 1810-1814 (1996) - [j2]François Desbouvries:
Spherical trigonometry, Yule's PARCOR identity, and FRLS fully normalized lattice. IEEE Trans. Signal Process. 44(2): 427-430 (1996) - [c4]François Desbouvries, Phillip A. Regalia:
A minimal, givens rotation based FRLS lattice algorithm. EUSIPCO 1996: 1-4 - 1995
- [j1]Phillip A. Regalia, François Desbouvries:
Displacement Structures of Covariance Matrices, Lossless Systems, and Numerical Algorithm Design. SIAM J. Matrix Anal. Appl. 16(2): 536-564 (1995) - 1993
- [c3]François Desbouvries:
Recursive least-squares lattices and trigonometry in the spherical triangle. ICASSP (3) 1993: 404-407 - 1992
- [c2]François Desbouvries, Claude Guéguen:
An extended displacement operator for weakly structured covariance matrices. ICASSP 1992: 21-24
1980 – 1989
- 1989
- [c1]Claude Guéguen, François Desbouvries:
Preservation of displacement ranks and the numerical stability of time recursive fast algorithms. ICASSP 1989: 1294-1297
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 12:48 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
