O. Cappé, E. Moulines, and T. Rydén, Inference in hidden Markov models Springer Series in Statistics With Randal Douc's contributions to Chapter, 2005.

G. By and . Fort, Philippe Soulier and Moulines, and Chapter

N. A. Cressie, Statistics for Spatial Data, 1993.

B. Ferris, D. Hähnel, and D. Fox, Gaussian Processes for Signal Strength-Based Location Estimation, Robotics: Science and Systems II, p.11, 2006.
DOI : 10.15607/RSS.2006.II.039

X. Guyon, Statistique spatiale, 2007.

D. G. Krige, A statistical approach to some basic mine valuation problems on the witwatersrand, Journal of the Chemical, Metallurgical and Mining Society, vol.52, p.119139, 1951.

G. Matheron, La théorie des variables régionalisées at ses appplications, École des Mines, 1970.

B. Ferris, D. Hähnel, and D. Fox, Gaussian Processes for Signal Strength-Based Location Estimation, Robotics: Science and Systems II, p.11, 2006.
DOI : 10.15607/RSS.2006.II.039

G. Fort and E. Moulines, Convergence of the Monte Carlo Expectation Maximization for curved exponential families, Ann. Statist, vol.31, issue.4, p.12201259, 2003.

H. T. Friis, A Note on a Simple Transmission Formula, Proceedings of the IRE, p.254256, 1946.
DOI : 10.1109/JRPROC.1946.234568

E. Gaura, L. Girod, J. Brusey, M. Allen, and G. Challen, Wireless Sensor Networks: Deployments and Design Frameworks, 2010.
DOI : 10.1007/978-1-4419-5834-1

J. Gorce, K. Jares-runser, and G. Roche, Deterministic Approach for Fast Simulations of Indoor Radio Wave Propagation, IEEE Transactions on Antennas and Propagation, vol.55, issue.3, 2007.
DOI : 10.1109/TAP.2007.891811
URL : https://hal.archives-ouvertes.fr/inria-00404836

S. Y. Lau, T. H. Lin, T. Y. Huang, I. H. Ng, and P. Huang, A measurement study of zigbee-based indoor localization systems under RF interference, Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization, WINTECH '09, p.3542, 2009.
DOI : 10.1145/1614293.1614300

L. Cor and G. Fort, Online Expectation Maximization based algorithms for inference in Hidden Markov Models, 2011.

S. , L. Cor, G. Fort, and E. Moulines, Online EM algorithm to solve the SLAM problem, IEEE Workshop on Statistical Signal Processing (SPP), 2011.

G. Mongillo and S. Denève, Online Learning with Hidden Markov Models, Neural Computation, vol.20, issue.7, pp.1706171610-1706171616, 2008.
DOI : 10.1162/089976600300015853

R. Adamczak and W. Bednorz, Exponential concentration inequalities for additive functionals of Markov chains, ESAIM: Probability and Statistics, vol.19, 2012.
DOI : 10.1051/ps/2014032

T. Bröcker and L. Lander, Dierentiable Germs and Catastrophes Lecture Note Series, 1975.

R. J. Carroll and P. Hall, Optimal Rates of Convergence for Deconvolving a Density, Journal of the American Statistical Association, vol.74, issue.404, p.11841186, 1988.
DOI : 10.1080/01621459.1988.10478718

R. J. Carroll and L. A. Stefanski, Deconvolving kernel density estimators, Statistics, vol.21, p.169184, 1990.

G. Churchill, Hidden Markov chains and the analysis of genome structure, Computers & Chemistry, vol.16, issue.2, p.107115, 1992.
DOI : 10.1016/0097-8485(92)80037-Z

F. Comte and M. Taupin, Nonparametric estimation of the regression function in an errors-invariables model, Statistica sinica, vol.17, issue.3, p.10651090, 2007.

A. P. Dempster, N. M. Laird, and D. B. Rubin, Maximum likelihood from incomplete data via the EM algorithm, J. Roy. Statist. Soc. B, vol.39, issue.1, p.138, 1977.

R. Douc, E. Moulines, and J. Rosenthal, Quantitative Bounds for Geometric Convergence Rates of Markov Chains, Ann. Appl. Probab, vol.14, issue.4, p.16431665, 2004.

P. Doukhan, P. Massart, and E. Rio, Invariance principle for absolutely regular processes. Annales de l'Institut Henri Poincaré, p.393427, 1995.

T. Dumont and S. L. Cor, Supplement paper to nonparametric estimation in hidden Markov models, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00740635

T. Dumont and S. L. Cor, Simultaneous localization and mapping problem in wireless sensor networks, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00735105

L. C. Evans and R. F. Gariepy, Measure Theory and Fine Properties of Functions, Studies in Advanced Mathematics, 1992.

J. Fan and Y. K. Truong, Nonparametric Regression with Errors in Variables, The Annals of Statistics, vol.21, issue.4, 1993.
DOI : 10.1214/aos/1176349402

B. Juang and L. Rabiner, Hidden Markov Models for Speech Recognition, Technometrics, vol.50, issue.4, p.251272, 1991.
DOI : 10.1007/978-3-642-66286-7

C. Lacour, Nonparametric estimation of the stationary density and the transition density of a Markov chain, Stochastic Processes and their Applications, pp.232-260, 2008.
DOI : 10.1016/j.spa.2007.04.013
URL : https://hal.archives-ouvertes.fr/hal-01139399

C. Lacour, Adaptive estimation of the transition density of a particular hidden Markov chain, Journal of Multivariate Analysis, vol.99, issue.5, p.787814, 2008.
DOI : 10.1016/j.jmva.2007.04.006
URL : https://hal.archives-ouvertes.fr/hal-00115612

J. M. Lee, Introduction to Topological Manifolds, Graduate Texts in Mathematics, vol.202, 2000.
DOI : 10.1007/978-1-4419-7940-7

R. S. Mamon and R. J. Elliott, Hidden Markov Models in Finance, of International Series in Operations Research & Management Science, 2007.

P. Massart and J. Picard, Concentration inequalities and model selection: Ecole d'Eté de Probabilités de Saint-Flour XXXIII -2003

S. P. Meyn and R. L. Tweedie, Markov Chains and Stochastic Stability. Communications and control engineering, 2009.

R. Nickel and B. M. Potscher, Bracketing Metric Entropy Rates and Empirical Central Limit Theorems for Function Classes of Besov- and Sobolev-Type, Journal of Theoretical Probability, vol.74, issue.2, p.177199, 2001.
DOI : 10.1007/s10959-007-0058-1

E. Rio, Théorie asymptotique des processus aléatoires faiblement dépendants, 1990.

D. R. Smart, A fixed-point theorem, Mathematical Proceedings of the Cambridge Philosophical Society, vol.57, issue.02, 1980.
DOI : 10.1017/S0305004100035404

S. A. Van-de and . Geer, Empirical Processes in M-Estimation. Cambridge Series in Statistical and Probabilistic Mathematics, 2009.

.. Numerical, 142 simulations, avec quelquefois des surestimations pouvant être causées par les phénomènes de minima locaux

. Application-de-l-'algorithme-À-la-géolocalisation, Cet algorithme possède une complexité bien plus élevée que les algorithmes développés pour les VLMC puisqu'il nécessite le calcul de la vraisemblance (eectué grâce à l'algorithme EM) pour un grand nombre d'arbres de contextes. L'estimation de l'arbre de contextes dans le cadre de la géolocalisation (où le nombre d'états à considérer est élevé) an de prendre en compte la dynamique du mobile dans le modèle, nécessiterait donc une optimisation de l'algorithme. De plus, il faudrait donner une structure de dépendance spatiale

P. Collet, A. Galves, and F. Leonardi, Random perturbations of stochastic processes with unbounded variable length memory, Electronic Journal of Probability, vol.13, issue.0, pp.13-538, 2008.
DOI : 10.1214/EJP.v13-538

I. Csiszar and Z. Talata, Context tree estimation for not necessarily nite memory processes, via BIC and MDL, IEEE Trans. Inf. Theor, vol.52, issue.3, p.10071016, 2006.

A. Garivier, Consistency of the Unlimited BIC Context Tree Estimator, IEEE Transactions on Information Theory, vol.52, issue.10, p.46304635, 2006.
DOI : 10.1109/TIT.2006.881742

J. Rissanen, A universal data compression system, IEEE Transactions on Information Theory, vol.29, issue.5, pp.656-664, 1983.
DOI : 10.1109/TIT.1983.1056741

Y. Wang, The variable-length hidden Markov Model and its applications on sequential data mining, 2005.

L. Zhou, . J. Wang, Y. Wang, and Z. Q. Liu, Mining complex time-series by learning Markovian models, Proceedings ICDM'06, sixth international conference on data mining, 2005.

F. M. Willems, The Context-Tree Weighting Method : Extensions, IEEE Transactions on Information Theory, vol.44, p.792798, 1994.
DOI : 10.1109/18.661523
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.2023

F. M. Willems, Y. , M. Shtarkov, and T. J. Tjalkens, The context-tree weighting method: basic properties, IEEE Transactions on Information Theory, vol.41, issue.3, p.653664, 1995.
DOI : 10.1109/18.382012

N. Basic-settings, 158 11.2.1 Context trees and variable length Markov chains, 158 11.2.2 Variable length hidden Markov models, p.159

.. The-general-strong-consistency-theorem, 160 11.3.1 An information theoretic inequality, p.166

S. Algorithm, 170 11.5.1 Algorithm, p.173

O. Cappé, E. Moulines, and T. Rydén, Inference in hidden Markov models Springer Series in Statistics With Randal Douc's contributions to Chapter, 2005.

G. By and . Fort, Philippe Soulier and Moulines, and Chapter

O. Catoni and J. Picard, Statistical learning theory and stochastic optimization: Ecole D'été de Probabilités de Saint-Flour XXXI-2001
DOI : 10.1007/b99352

A. Chambaz, A. Garivier, and E. Gassiat, A MDL approach to HMM with Poisson and Gaussian emissions. Application to order indentication, Journal of Stat. Planning and Inf, vol.139, p.962977, 2009.

F. Evennou, Techniques et technologies de localisation avancées pour terminaux mobiles dans les environnements indoor, 2007.

L. Finesso, Consistent estimation of the order for Markov and hidden Markov chains, 1990.

A. Garivier, Consistency of the Unlimited BIC Context Tree Estimator, IEEE Transactions on Information Theory, vol.52, issue.10, p.46304635, 2006.
DOI : 10.1109/TIT.2006.881742

E. Gassiat and O. , Codage universel et sélection de modèles emboités, p.2, 2011.

E. Gassiat and S. Boucheron, Optimal error exponents in hidden markov models order estimation, IEEE Transactions on Information Theory, vol.49, issue.4, p.964980, 2003.
DOI : 10.1109/TIT.2003.809574

E. Gassiat and C. Keribin, The likelihood ratio tets for the number of components in a mixture with Markov regime, ESAIM P&S, 2000.

E. Gassiat and R. Van-handel, Pathwise uctuations of likelihood ratios and consistent order estimation, 2010.

N. Katoh, M. Inaba, and H. Imai, Applications of weighted voronoi diagrams and randomization to variance based k-clustering, Proceedings of the tenth annual symposium computational geometry, p.332339, 1994.

R. E. Krichevsky and V. K. Tromov, The performance of universal encoding, IEEE Transactions on Information Theory, vol.27, issue.2, 1981.
DOI : 10.1109/TIT.1981.1056331

B. Leroux, Maximum-likelihood estimator for hidden Markov models, Stoch. Proc. Appl, vol.40, p.127143, 1992.

J. Mcqueen, Some methods for classication and analysis of multivariate observations, Proceedings of the 5th Berkeley Sympos. Math. Statist. and Probability, p.281297, 1967.

J. Rissanen, A universal data compression system, IEEE Transactions on Information Theory, vol.29, issue.5, pp.656-664, 1983.
DOI : 10.1109/TIT.1983.1056741

H. Teicher, Identiability of mixtures, Ann. Math. Stat, vol.32, issue.1, p.244248, 1961.

R. Van-handel, On the minimal penalty for Markov order estimation, Probability Theory and Related Fields, vol.39, issue.3, 2011.
DOI : 10.1007/s00440-010-0290-y

Y. Wang, The variable-length hidden Markov Model and its applications on sequential data mining, 2005.

L. Zhou, . J. Wang, Y. Wang, and Z. Q. Liu, Mining complex time-series by learning Markovian models, Proceedings ICDM'06, sixth international conference on data mining, 2005.

E. T. Whittaker and G. N. Watson, A Course of Modern Analysis: An Introduction to the General Theory of Innite Processes and of Analytic Functions, with an Account of the Principal Transcendental Functions. Cambridge Mathematical Library, 1996.

S. Y. Yakowitz and J. D. Spragins, On the identiability of nite mixtures, Ann. Math. Stat, vol.39, issue.1, p.209214, 1968.