نتایج جستجو برای: baum welch algorithm
تعداد نتایج: 756000 فیلتر نتایج به سال:
In this work we consider the problem of Hidden Markov Models (HMM) training. This problem can be considered as a global optimization problem and we focus our study on the Particle Swarm Optimization (PSO) algorithm. To take advantage of the search strategy adopted by PSO, we need to modify the HMM’s search space. Moreover, we introduce a local search technique from the field of HMMs and that is...
A standard method to obtain stochastic models for symbolic time series is to train state-emitting hidden Markov models (SE-HMMs) with the Baum-Welch algorithm. Based on observable operator models (OOMs), in the last few months a number of novel learning algorithms for similar purposes have been developed: (1,2) two versions of an ”efficiency sharpening” (ES) algorithm, which iteratively improve...
Die Messung der Blattbedeckung auf Baumniveau gibt Auskunft über die Wachstumskapazität des Baums und ermöglicht eine Bewertung des möglichen Ertrags oder den Einfluss der reduzierten Wasserversor-gung in einem Obstgarten auf den Ertrag. Die Messung erfolgt mittels zweier optischer Verfahren: NIR (nahes Infrarot) Bildanalyse, Trefferzahl eines Laserscanners (LiDAR) pro Baum in einer Pflaumenpla...
Topological rigidity is an analogue of the Baum-Connes conjecture, and is motivated by Mostow rigidity and Margulis superrigidity. I will discuss some of the places where this heuristic reasoning fails, and the rigidity shows some cracks – that are rather different than the places where strong forms of the Baum-Connes conjecture fails.
We give a proof that the geometric K-homology theory for finite CWcomplexes defined by Baum and Douglas is isomorphic to Kasparov’s Khomology. The proof is a simplification of more elaborate arguments which deal with the geometric formulation of equivariant K-homology theory.
The canonical trace on the reduced C∗-algebra of a discrete group gives rise to a homomorphism from the K-theory of this C∗-algebra to the real numbers. This paper studies the range of this homomorphism. For torsion free groups, the Baum-Connes conjecture together with Atiyah’s L-index theorem implies that the range consists of the integers. We give a direct and elementary proof that if G acts ...
This paper will present new Czech language twochannel (stereo) speech database recorded in car environment. The created database was designed for experiments with speech enhancement for communication purposes and for the study and the design of a robust speech recognition systems. It respects car noise environment which is currently at the top of the interest. Tools for automated phoneme labell...
We present a method for conditional maximum likelihood estimation of N-gram models used for text or speech utterance classification. The method employs a well known technique relying on a generalization of the Baum-Eagon inequality from polynomials to rational functions. The best performance is achieved for the 1-gram classifier where conditional maximum likelihood training reduces the class er...
Virtuelles Screening ist zu einem integralen und bedeutsamen Bestandteil der modernen Wirkstoffforschung geworden. Strukturbasierte virtuelle Screening-Verfahren analysieren die dreidimensionale Struktur des Zielmoleküls, dessen Funktion beeinflusst werden soll, um in großen virtuellen ScreeningBibliotheken nach Molekülen zu suchen, die hinsichtlich des Zielmoleküls biologisch aktiv sind. In de...
We obtain the equivariant K-homology of the classifying space EW for W a right-angled or, more generally, an even Coxeter group. The key result is a formula for the relative Bredon homology of EW in terms of Coxeter cells. Our calculations amount to the K-theory of the reduced C∗-algebra of W , via the Baum-Connes assembly map.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید