Gotowa bibliografia na temat „Partitions de Markov”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Spis treści
Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Partitions de Markov”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Artykuły w czasopismach na temat "Partitions de Markov"
Crane, Harry, i Peter McCullagh. "Reversible Markov structures on divisible set partitions". Journal of Applied Probability 52, nr 03 (wrzesień 2015): 622–35. http://dx.doi.org/10.1017/s0021900200113336.
Pełny tekst źródłaCrane, Harry, i Peter McCullagh. "Reversible Markov structures on divisible set partitions". Journal of Applied Probability 52, nr 3 (wrzesień 2015): 622–35. http://dx.doi.org/10.1239/jap/1445543836.
Pełny tekst źródłaInfante, Guillermo, Anders Jonsson i Vicenç Gómez. "Globally Optimal Hierarchical Reinforcement Learning for Linearly-Solvable Markov Decision Processes". Proceedings of the AAAI Conference on Artificial Intelligence 36, nr 6 (28.06.2022): 6970–77. http://dx.doi.org/10.1609/aaai.v36i6.20655.
Pełny tekst źródłaCawley, Elise. "Smooth Markov partitions and toral automorphisms". Ergodic Theory and Dynamical Systems 11, nr 4 (grudzień 1991): 633–51. http://dx.doi.org/10.1017/s0143385700006404.
Pełny tekst źródłaJung, Ho Yub, i Kyoung Mu Lee. "Image Segmentation by Edge Partitioning over a Nonsubmodular Markov Random Field". Mathematical Problems in Engineering 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/683176.
Pełny tekst źródłaAshley, Jonathan, Bruce Kitchens i Matthew Stafford. "Boundaries of Markov partitions". Transactions of the American Mathematical Society 333, nr 1 (1.01.1992): 177–201. http://dx.doi.org/10.1090/s0002-9947-1992-1073772-3.
Pełny tekst źródłaWagoner, J. B. "Markov partitions and K2". Publications mathématiques de l'IHÉS 65, nr 1 (grudzień 1987): 91–129. http://dx.doi.org/10.1007/bf02698936.
Pełny tekst źródłaBorodin, Alexei, i Grigori Olshanski. "Markov processes on partitions". Probability Theory and Related Fields 135, nr 1 (17.08.2005): 84–152. http://dx.doi.org/10.1007/s00440-005-0458-z.
Pełny tekst źródłaNEKRASHEVYCH, VOLODYMYR. "SELF-SIMILAR INVERSE SEMIGROUPS AND SMALE SPACES". International Journal of Algebra and Computation 16, nr 05 (październik 2006): 849–74. http://dx.doi.org/10.1142/s0218196706003153.
Pełny tekst źródłaFriston, Karl, Conor Heins, Kai Ueltzhöffer, Lancelot Da Costa i Thomas Parr. "Stochastic Chaos and Markov Blankets". Entropy 23, nr 9 (17.09.2021): 1220. http://dx.doi.org/10.3390/e23091220.
Pełny tekst źródłaRozprawy doktorskie na temat "Partitions de Markov"
Kenny, Robert. "Orbit complexity and computable Markov partitions". University of Western Australia. School of Mathematics and Statistics, 2008. http://theses.library.uwa.edu.au/adt-WU2008.0231.
Pełny tekst źródłaPraggastis, Brenda L. "Markov partitions for hyperbolic toral automorphisms /". Thesis, Connect to this title online; UW restricted, 1992. http://hdl.handle.net/1773/5773.
Pełny tekst źródłaJeandenans, Emmanuelle. "Difféomorphismes hyperboliques des surfaces et combinatoires des partitions de Markov". Dijon, 1996. http://www.theses.fr/1996DIJOS032.
Pełny tekst źródłaCruz, Diaz Inti. "An Algorithmic Classification of Generalized Pseudo-Anosov Homeomorphisms via Geometric Markov Partitions". Electronic Thesis or Diss., Bourgogne Franche-Comté, 2023. http://www.theses.fr/2023UBFCK083.
Pełny tekst źródłaThis thesis aims to provide a classification of generalized pseudo-Anosov homeomorphisms up to topological conjugacy using an algorithmic approach. This entails obtaining finite and computable invariants for each conjugacy class.A Markov partition of a generalized pseudo-Anosov homeomorphism is a decomposition of the surface into a finite number of rectangles with disjoint interiors and such that their images intersect with any other rectangle in the Markov partition along a finite number of horizontal sub-rectangles. Every generalized pseudo-Anosov homeomorphism has a Markov partition, and, using the surface's orientation, we can endow any Markov partition with a geometrization. This process involves labeling the rectangles and choosing an orientation on the stable and unstable leaves of each of these rectangles.The geometric type of a geometric Markov partition was defined by Bonatti and Langevin in their book, "Difféomorphismes de Smale des surfaces," to classify saddle-type basic pieces for structurally stable diffeomorphisms on surfaces. A geometric type is an abstract combinatorial object that generalizes the incidence matrix of a Markov partition. It takes into account not only the number of times the image of a rectangle intersects with any other rectangle in the family but also the order and change of orientation induced by the homeomorphisms.This thesis employs the geometric type of a geometric Markov partition to classify the conjugacy classes of pseudo-Anosov homeomorphisms. Our main results can be summarized as follows:The geometric type is a complete invariant of conjugation: A pair of generalized pseudo-Anosov homeomorphisms is topologically conjugate to each other through an orientation-preserving homeomorphism if and only if they have geometric Markov partitions with the same geometric type.The realization: Geometric types are defined broadly, and not every abstract geometric type corresponds to a pseudo-Anosov homeomorphism. A geometric type T is considered part of the pseudo-Anosov class if there exists a generalized pseudo-Anosov homeomorphism with a geometric Markov partition of geometric type T. Our second result provides a computable and combinatorial criterion for determining whether an abstract geometric type belongs to the pseudo-Anosov class.Equivalent representations: Every generalized pseudo-Anosov homeomorphism has an infinite number of geometric Markov partitions with different geometric types. Our third result is an algorithm for determining whether two geometric types in the pseudo-Anosov class are realized by generalized pseudo-Anosov homeomorphisms that are topologically conjugated or not
Wong, Chi-hung, i 黃志雄. "Hand-written Chinese character recognition by hidden Markov models andradical partition". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1998. http://hub.hku.hk/bib/B31220058.
Pełny tekst źródłaWingate, David. "Solving Large MDPs Quickly with Partitioned Value Iteration". Diss., CLICK HERE for online access, 2004. http://contentdm.lib.byu.edu/ETD/image/etd437.pdf.
Pełny tekst źródłaWong, Chi-hung. "Hand-written Chinese character recognition by hidden Markov models and radical partition /". Hong Kong : University of Hong Kong, 1998. http://sunzi.lib.hku.hk/hkuto/record.jsp?B19669380.
Pełny tekst źródłaSmith, Adam Nicholas. "Bayesian Analysis of Partitioned Demand Models". The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1497895561381294.
Pełny tekst źródłaHadriche, Abir. "Caractérisation du répertoire dynamique macroscopique de l'activité électrique cérébrale humaine au repos". Thesis, Aix-Marseille, 2013. http://www.theses.fr/2013AIXM4724/document.
Pełny tekst źródłaWe propose an algorithme based on set oriented approach of dynamical system to extract a coarse grained organization of brain state space on the basis of EEG signals. We use it for comparing the organization of the state space of large scale simulation of brain dynamics with actual brain dynamics of resting activity in healthy and SEP subjects
Joder, Cyril. "Alignement temporel musique-sur-partition par modèles graphiques discriminatifs". Phd thesis, Télécom ParisTech, 2011. http://pastel.archives-ouvertes.fr/pastel-00664260.
Pełny tekst źródłaKsiążki na temat "Partitions de Markov"
Field, Mike. Ergodic theory of equivariant diffeomorphisms: Markov partitions and stable ergodicity. Providence, R.I: American Mathematical Society, 2004.
Znajdź pełny tekst źródłaCsenki, Attila. Dependability for systems with a partitioned state space: Markov and semi-Markov theory and computational implementation. New York: Springer-Verlag, 1994.
Znajdź pełny tekst źródłaBabington, Mary F., i Christine M. Shearer. Private companies in prebuilt housing components: Trusses, walls & partitions, pre-hung windows & doors, millwork and other prebuilt housing components. Cleveland, Ohio: Freedonia Group, 1998.
Znajdź pełny tekst źródłaParametric state space structuring. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1997.
Znajdź pełny tekst źródłaFarb, Benson, i Dan Margalit. Thurston's Proof. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691147949.003.0016.
Pełny tekst źródłaCsenki, Attila. Dependability for Systems with a Partitioned State Space: Markov and Semi-Markov Theory and Computational Implementation. Springer, 2014.
Znajdź pełny tekst źródłaCsenki, Attila. Dependability for Systems with a Partitioned State Space: Markov and Semi-Markov Theory and Computational Implementation. Springer London, Limited, 2012.
Znajdź pełny tekst źródłaMisri, Deepti. Introduction. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038853.003.0001.
Pełny tekst źródłaMakatjane, Katleho, i Roscoe van Wyk. Identifying structural changes in the exchange rates of South Africa as a regime-switching process. UNU-WIDER, 2020. http://dx.doi.org/10.35188/unu-wider/2020/919-8.
Pełny tekst źródłaCzęści książek na temat "Partitions de Markov"
Shub, Michael. "Markov Partitions". W Global Stability of Dynamical Systems, 122–46. New York, NY: Springer New York, 1987. http://dx.doi.org/10.1007/978-1-4757-1947-5_10.
Pełny tekst źródłaBarreira, Luis. "Invariant Manifolds and Markov Partitions". W Ergodic Theory, Hyperbolic Dynamics and Dimension Theory, 201–31. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. http://dx.doi.org/10.1007/978-3-642-28090-0_7.
Pełny tekst źródłaSinai, Ya G. "Markov Partitions and C-Diffeomorphisms". W Selecta, 257–79. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-87870-6_11.
Pełny tekst źródłaBlanchard, Philippe, i Dimitri Volchenkov. "Introduction to Permutations, Markov Chains, and Partitions". W Springer Series in Synergetics, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19592-1_1.
Pełny tekst źródłaKitchens, Bruce. "Symbolic Dynamics, Group Automorphisms and Markov Partitions". W Real and Complex Dynamical Systems, 133–63. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-015-8439-5_6.
Pełny tekst źródłaPesin, Yakov. "Sinai’s Work on Markov Partitions and SRB Measures". W The Abel Prize, 257–85. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-99028-6_11.
Pełny tekst źródłaKalpazidou, S. "Cycle Representations of Markov Processes: An Application to Rotational Partitions". W Stochastic Processes and Related Topics, 253–73. Boston, MA: Birkhäuser Boston, 1998. http://dx.doi.org/10.1007/978-1-4612-2030-5_14.
Pełny tekst źródłaKatsikas, Anastassis A., i John S. Nicolis. "Chaotic dynamics of generating Markov partitions, and linguistic sequences mimicking Zipf's law". W Parallelism, Learning, Evolution, 335–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-55027-5_20.
Pełny tekst źródłaCsenki, Attila. "Sojourn times for Discrete-Parameter Markov Chains". W Dependability for Systems with a Partitioned State Space, 14–52. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-2674-1_2.
Pełny tekst źródłaCsenki, Attila. "Sojourn Times for Continuous-Parameter Markov Chains". W Dependability for Systems with a Partitioned State Space, 69–105. New York, NY: Springer New York, 1994. http://dx.doi.org/10.1007/978-1-4612-2674-1_4.
Pełny tekst źródłaStreszczenia konferencji na temat "Partitions de Markov"
Gerontidis, Ioannis I., i Stavros P. Kontakos. "Markov Chain Lumpability on Fuzzy Partitions". W 2007 IEEE International Fuzzy Systems Conference. IEEE, 2007. http://dx.doi.org/10.1109/fuzzy.2007.4295387.
Pełny tekst źródłaGerontidis, Ioannis I., i Ioannis E. Petasakis. "Lumpability of absorbing Markov chains and replacement chains on fuzzy partitions". W 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2010. http://dx.doi.org/10.1109/fuzzy.2010.5584241.
Pełny tekst źródłaArruda, Edilson F., Marcelo D. Fragoso i Fabricio O. Ourique. "Multi-partition time aggregation for Markov Chains". W 2017 IEEE 56th Annual Conference on Decision and Control (CDC). IEEE, 2017. http://dx.doi.org/10.1109/cdc.2017.8264387.
Pełny tekst źródłaLu, Youwei, Shogo Okada i Katsumi Nitta. "Weibull partition models with applications to hidden semi-Markov models". W 2017 International Joint Conference on Neural Networks (IJCNN). IEEE, 2017. http://dx.doi.org/10.1109/ijcnn.2017.7965850.
Pełny tekst źródłaChatterjee, Shankar, i Rama Chellappa. "Texture Segmentation Using Gaussian Markov Random Field Models". W Machine Vision. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/mv.1985.fb3.
Pełny tekst źródłaHu, He, Shuping Yao i Peng Wu. "Security Decision Making Based on Domain Partitional Markov Decision Process". W 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5365272.
Pełny tekst źródłaWu, Jue, i Albert C. S. Chung. "Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy". W 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07. IEEE, 2007. http://dx.doi.org/10.1109/icassp.2007.366715.
Pełny tekst źródłaViola, M. L. Lanfredi, i Jesús E. García. "Independence’s partition of the set of coordinates of a multivariate Markov chain". W INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: ICNAAM2022. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0211060.
Pełny tekst źródłaLv, Hai Rong, Wen Jun Yin i Jin Dong. "Off-line signature verification based on deformable grid partition and Hidden Markov Models". W 2009 IEEE International Conference on Multimedia and Expo (ICME). IEEE, 2009. http://dx.doi.org/10.1109/icme.2009.5202512.
Pełny tekst źródłaKrause, Oswin, Asja Fischer i Christian Igel. "Algorithms for Estimating the Partition Function of Restricted Boltzmann Machines (Extended Abstract)". W Twenty-Ninth International Joint Conference on Artificial Intelligence and Seventeenth Pacific Rim International Conference on Artificial Intelligence {IJCAI-PRICAI-20}. California: International Joint Conferences on Artificial Intelligence Organization, 2020. http://dx.doi.org/10.24963/ijcai.2020/704.
Pełny tekst źródła