Auswahl der wissenschaftlichen Literatur zum Thema „Partitions de Markov“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Inhaltsverzeichnis
Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Partitions de Markov" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Zeitschriftenartikel zum Thema "Partitions de Markov"
Crane, Harry, und Peter McCullagh. „Reversible Markov structures on divisible set partitions“. Journal of Applied Probability 52, Nr. 03 (September 2015): 622–35. http://dx.doi.org/10.1017/s0021900200113336.
Der volle Inhalt der QuelleCrane, Harry, und Peter McCullagh. „Reversible Markov structures on divisible set partitions“. Journal of Applied Probability 52, Nr. 3 (September 2015): 622–35. http://dx.doi.org/10.1239/jap/1445543836.
Der volle Inhalt der QuelleInfante, Guillermo, Anders Jonsson und 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.
Der volle Inhalt der QuelleCawley, Elise. „Smooth Markov partitions and toral automorphisms“. Ergodic Theory and Dynamical Systems 11, Nr. 4 (Dezember 1991): 633–51. http://dx.doi.org/10.1017/s0143385700006404.
Der volle Inhalt der QuelleJung, Ho Yub, und 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.
Der volle Inhalt der QuelleAshley, Jonathan, Bruce Kitchens und Matthew Stafford. „Boundaries of Markov partitions“. Transactions of the American Mathematical Society 333, Nr. 1 (01.01.1992): 177–201. http://dx.doi.org/10.1090/s0002-9947-1992-1073772-3.
Der volle Inhalt der QuelleWagoner, J. B. „Markov partitions and K2“. Publications mathématiques de l'IHÉS 65, Nr. 1 (Dezember 1987): 91–129. http://dx.doi.org/10.1007/bf02698936.
Der volle Inhalt der QuelleBorodin, Alexei, und 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.
Der volle Inhalt der QuelleNEKRASHEVYCH, VOLODYMYR. „SELF-SIMILAR INVERSE SEMIGROUPS AND SMALE SPACES“. International Journal of Algebra and Computation 16, Nr. 05 (Oktober 2006): 849–74. http://dx.doi.org/10.1142/s0218196706003153.
Der volle Inhalt der QuelleFriston, Karl, Conor Heins, Kai Ueltzhöffer, Lancelot Da Costa und Thomas Parr. „Stochastic Chaos and Markov Blankets“. Entropy 23, Nr. 9 (17.09.2021): 1220. http://dx.doi.org/10.3390/e23091220.
Der volle Inhalt der QuelleDissertationen zum Thema "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.
Der volle Inhalt der QuellePraggastis, Brenda L. „Markov partitions for hyperbolic toral automorphisms /“. Thesis, Connect to this title online; UW restricted, 1992. http://hdl.handle.net/1773/5773.
Der volle Inhalt der QuelleJeandenans, Emmanuelle. „Difféomorphismes hyperboliques des surfaces et combinatoires des partitions de Markov“. Dijon, 1996. http://www.theses.fr/1996DIJOS032.
Der volle Inhalt der QuelleCruz, 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.
Der volle Inhalt der QuelleThis 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, und 黃志雄. „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.
Der volle Inhalt der QuelleWingate, 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.
Der volle Inhalt der QuelleWong, 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.
Der volle Inhalt der QuelleSmith, Adam Nicholas. „Bayesian Analysis of Partitioned Demand Models“. The Ohio State University, 2017. http://rave.ohiolink.edu/etdc/view?acc_num=osu1497895561381294.
Der volle Inhalt der QuelleHadriche, 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.
Der volle Inhalt der QuelleWe 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.
Der volle Inhalt der QuelleBücher zum Thema "Partitions de Markov"
Field, Mike. Ergodic theory of equivariant diffeomorphisms: Markov partitions and stable ergodicity. Providence, R.I: American Mathematical Society, 2004.
Den vollen Inhalt der Quelle findenCsenki, Attila. Dependability for systems with a partitioned state space: Markov and semi-Markov theory and computational implementation. New York: Springer-Verlag, 1994.
Den vollen Inhalt der Quelle findenBabington, Mary F., und 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.
Den vollen Inhalt der Quelle findenParametric state space structuring. Hampton, VA: Institute for Computer Applications in Science and Engineering, NASA Langley Research Center, 1997.
Den vollen Inhalt der Quelle findenFarb, Benson, und Dan Margalit. Thurston's Proof. Princeton University Press, 2017. http://dx.doi.org/10.23943/princeton/9780691147949.003.0016.
Der volle Inhalt der QuelleCsenki, Attila. Dependability for Systems with a Partitioned State Space: Markov and Semi-Markov Theory and Computational Implementation. Springer, 2014.
Den vollen Inhalt der Quelle findenCsenki, Attila. Dependability for Systems with a Partitioned State Space: Markov and Semi-Markov Theory and Computational Implementation. Springer London, Limited, 2012.
Den vollen Inhalt der Quelle findenMisri, Deepti. Introduction. University of Illinois Press, 2017. http://dx.doi.org/10.5406/illinois/9780252038853.003.0001.
Der volle Inhalt der QuelleMakatjane, Katleho, und 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.
Der volle Inhalt der QuelleBuchteile zum Thema "Partitions de Markov"
Shub, Michael. „Markov Partitions“. In 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.
Der volle Inhalt der QuelleBarreira, Luis. „Invariant Manifolds and Markov Partitions“. In 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.
Der volle Inhalt der QuelleSinai, Ya G. „Markov Partitions and C-Diffeomorphisms“. In Selecta, 257–79. New York, NY: Springer New York, 2010. http://dx.doi.org/10.1007/978-0-387-87870-6_11.
Der volle Inhalt der QuelleBlanchard, Philippe, und Dimitri Volchenkov. „Introduction to Permutations, Markov Chains, and Partitions“. In Springer Series in Synergetics, 1–17. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-19592-1_1.
Der volle Inhalt der QuelleKitchens, Bruce. „Symbolic Dynamics, Group Automorphisms and Markov Partitions“. In Real and Complex Dynamical Systems, 133–63. Dordrecht: Springer Netherlands, 1995. http://dx.doi.org/10.1007/978-94-015-8439-5_6.
Der volle Inhalt der QuellePesin, Yakov. „Sinai’s Work on Markov Partitions and SRB Measures“. In The Abel Prize, 257–85. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-319-99028-6_11.
Der volle Inhalt der QuelleKalpazidou, S. „Cycle Representations of Markov Processes: An Application to Rotational Partitions“. In 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.
Der volle Inhalt der QuelleKatsikas, Anastassis A., und John S. Nicolis. „Chaotic dynamics of generating Markov partitions, and linguistic sequences mimicking Zipf's law“. In Parallelism, Learning, Evolution, 335–63. Berlin, Heidelberg: Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-55027-5_20.
Der volle Inhalt der QuelleCsenki, Attila. „Sojourn times for Discrete-Parameter Markov Chains“. In 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.
Der volle Inhalt der QuelleCsenki, Attila. „Sojourn Times for Continuous-Parameter Markov Chains“. In 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.
Der volle Inhalt der QuelleKonferenzberichte zum Thema "Partitions de Markov"
Gerontidis, Ioannis I., und Stavros P. Kontakos. „Markov Chain Lumpability on Fuzzy Partitions“. In 2007 IEEE International Fuzzy Systems Conference. IEEE, 2007. http://dx.doi.org/10.1109/fuzzy.2007.4295387.
Der volle Inhalt der QuelleGerontidis, Ioannis I., und Ioannis E. Petasakis. „Lumpability of absorbing Markov chains and replacement chains on fuzzy partitions“. In 2010 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE). IEEE, 2010. http://dx.doi.org/10.1109/fuzzy.2010.5584241.
Der volle Inhalt der QuelleArruda, Edilson F., Marcelo D. Fragoso und Fabricio O. Ourique. „Multi-partition time aggregation for Markov Chains“. In 2017 IEEE 56th Annual Conference on Decision and Control (CDC). IEEE, 2017. http://dx.doi.org/10.1109/cdc.2017.8264387.
Der volle Inhalt der QuelleLu, Youwei, Shogo Okada und Katsumi Nitta. „Weibull partition models with applications to hidden semi-Markov models“. In 2017 International Joint Conference on Neural Networks (IJCNN). IEEE, 2017. http://dx.doi.org/10.1109/ijcnn.2017.7965850.
Der volle Inhalt der QuelleChatterjee, Shankar, und Rama Chellappa. „Texture Segmentation Using Gaussian Markov Random Field Models“. In Machine Vision. Washington, D.C.: Optica Publishing Group, 1985. http://dx.doi.org/10.1364/mv.1985.fb3.
Der volle Inhalt der QuelleHu, He, Shuping Yao und Peng Wu. „Security Decision Making Based on Domain Partitional Markov Decision Process“. In 2009 International Conference on Information Engineering and Computer Science. ICIECS 2009. IEEE, 2009. http://dx.doi.org/10.1109/iciecs.2009.5365272.
Der volle Inhalt der QuelleWu, Jue, und Albert C. S. Chung. „Markov Random Field Energy Minimization via Iterated Cross Entropy with Partition Strategy“. In 2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07. IEEE, 2007. http://dx.doi.org/10.1109/icassp.2007.366715.
Der volle Inhalt der QuelleViola, M. L. Lanfredi, und Jesús E. García. „Independence’s partition of the set of coordinates of a multivariate Markov chain“. In INTERNATIONAL CONFERENCE OF NUMERICAL ANALYSIS AND APPLIED MATHEMATICS: ICNAAM2022. AIP Publishing, 2024. http://dx.doi.org/10.1063/5.0211060.
Der volle Inhalt der QuelleLv, Hai Rong, Wen Jun Yin und Jin Dong. „Off-line signature verification based on deformable grid partition and Hidden Markov Models“. In 2009 IEEE International Conference on Multimedia and Expo (ICME). IEEE, 2009. http://dx.doi.org/10.1109/icme.2009.5202512.
Der volle Inhalt der QuelleKrause, Oswin, Asja Fischer und Christian Igel. „Algorithms for Estimating the Partition Function of Restricted Boltzmann Machines (Extended Abstract)“. In 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.
Der volle Inhalt der Quelle