• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 426
  • 42
  • 25
  • 24
  • 20
  • 16
  • 16
  • 16
  • 16
  • 16
  • 15
  • 10
  • 5
  • 2
  • 2
  • Tagged with
  • 637
  • 637
  • 140
  • 97
  • 94
  • 79
  • 67
  • 63
  • 57
  • 56
  • 55
  • 53
  • 52
  • 52
  • 50
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
121

HMM-based non-intrusive speech quality and implementation of Viterbi score distribution and hiddenness based measures to improve the performance of speech recognition

Talwar, Gaurav. January 2006 (has links)
Thesis (Ph. D.)--University of Wyoming, 2006. / Title from PDF title page (viewed on June 26, 2008). Includes bibliographical references (p. 116-122).
122

Joint-space adaptation technique for robust continuous speech recognition /

Wang, Chien-Jen. January 1997 (has links)
Thesis (Ph. D.)--University of Washington, 1997. / Vita. Includes bibliographical references (leaves [81]-89).
123

A bayesian approach to motif-based protein modeling /

Grundy, William Noble. January 1998 (has links)
Thesis (Ph. D.)--University of California, San Diego, 1998. / Vita. Includes bibliographical references (leaves 167-177).
124

Automating inhabitant interactions in home and workplace environments through data-driven generation of hierarchical partially-observable Markov decision processes

Youngblood, Gregory Michael. Unknown Date (has links)
Thesis (Ph.D.)--The University of Texas at Arlington, 2005. / Source: Dissertation Abstracts International, Volume: 66-12, Section: B, page: 6746. Advisers: Lawrence B. Holder; Diane J. Cook.
125

Pipelined processor modeling with finite homogeneous discrete-time Markov chain /

Unwala, Ishaq Hasanali, January 1998 (has links)
Thesis (Ph. D.)--University of Texas at Austin, 1998. / Vita. Includes bibliographical references (leaves 130-134). Available also in a digital version from Dissertation Abstracts.
126

A study of some variations on the hidden Markov modelling approach to speaker independent isolated word speech recognition /

Leung, Shun Tak Albert. January 1990 (has links)
Thesis (M. Phil.)--University of Hong Kong, 1990.
127

Optimal strategies for electric energy contract decision making /

Song, Haili. January 2000 (has links)
Thesis (Ph. D.)--University of Washington, 2000. / Vita. Includes bibliographical references (leaves 87-95).
128

Micro and macro data in statistical inference on Markov chains

Rosenqvist, Gunnar. January 1986 (has links)
Thesis (doctoral)--Svenska handelshögskolan, 1986. / Extra t.p. inserted with thesis statement. Includes bibliographical references (p. 210-222).
129

Convergence analysis of MCMC method in the study of genetic linkage with missing data

Fisher, Diana. January 2005 (has links)
Theses (M.A.)--Marshall University, 2005. / Title from document title page. Includes abstract. Document formatted into pages: contains x, 75 p. Bibliography: p. 56-59.
130

Piecewise linear Markov decision processes with an application to partially observable Markov models

Sawaki, Katsushige January 1977 (has links)
This dissertation applies policy improvement and successive approximation or value iteration to a general class of Markov decision processes with discounted costs. In particular, a class of Markov decision processes, called piecewise-linear, is studied. Piecewise-linear processes are characterized by the property that the value function of a process observed for one period and then terminated is piecewise-linear if the terminal reward function is piecewise-linear. Partially observable Markov decision processes have this property. It is shown that there are e-optimal piecewise-linear value functions and piecewise-constant policies which are simple. Simple means that there are only finitely many pieces, each of which is defined on a convex polyhedral set. Algorithms based on policy improvement and successive approximation are developed to compute simple approximations to an optimal policy and the optimal value function. / Business, Sauder School of / Graduate

Page generated in 0.0897 seconds