نتایج جستجو برای: baum welch algorithm

تعداد نتایج: 756000  

1997
UDIGER KIESEL

In this note the almost sure convergence of stationary, '-mixing sequences of random variables with values in real, separable Banach spaces according to summability methods is linked to the fullllment of a certain integrability condition generalizing and extending the results for i.i.d. sequences. Furthermore we give via Baum-Katz type results an estimate for the rate of convergence in these laws.

2000
Thomas Schick

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 ...

2013
Tiberiu S. Chis

The possibility of handling infrequent, higher density, additional loads, used mainly for on-line characterization of workloads, is considered. This is achieved through a sliding version of a hidden Markov model (SlidHMM). Essentially, a SlidHMM keeps track of processes that change with time and the constant size of the observation set helps reduce the space and time complexity of the Baum-Welc...

2010
JONATHAN BLOCK

P. Baum and A. Connes have made a deep conjecture about the calculation of the K-theory of certain types of C∗-algebras [1, 2]. In particular, for a discrete group Γ they have conjectured the calculation of K∗(C r (Γ)), the Ktheory of the reduced C∗-algebra of Γ. So far, there is quite little evidence for this conjecture. For example, there is not a single property T group for which it is known...

2012
J. L. Tu

Given a (not necessarily discrete) proper metric space M with bounded geometry, we define a groupoid G(M). We show that the coarse Baum–Connes conjecture with coefficients, which states that the assembly map with coefficients for G(M) is an isomorphism, is hereditary by taking closed subspaces.

2002
René Weiskircher

Wir untersuchen zwei Probleme auf dem Gebiet des Zeichnens von Graphen. Bei beiden Problemen geht es darum, eine Funktion über der Menge aller Einbettungen eines planaren Graphen zu optimieren und wir verwenden jeweils SPQRBäume um die Probleme zu lösen. Das erste von uns betrachtete Problem ist das Einfügen einer zusätzlichen Kante in einen planaren Graphen mit möglichst wenigen Kreuzungen. Di...

Journal: :JACIII 2005
Kazuhisa Takemura Iyuki Takasaki Yumi Iwamitsu

We propose statistical image analysis for psychological projective drawings to facilitate assessing the reliability of the projective drawing making the determination of its validity difficult. Standard analysis involves (1) drawing a picture, (2) scanning the drawing, (3) dividing the drawing, (4) analyzing the gray level histogram moment (GLHM), (5) applying spatial gray level dependence meth...

2003
PAUL BALMER MICHEL MATTHEY

The Isomorphism Conjectures are translated into the language of homotopical algebra, where they resemble Thomason’s descent theorems.

1998
RÜDIGER KIESEL

In this note the almost sure convergence of stationary, φ-mixing sequences of random variables with values in real, separable Banach spaces according to summability methods is linked to the fulfillment of a certain integrability condition generalizing and extending the results for i.i.d. sequences. Furthermore we give via Baum-Katz type results an estimate for the rate of convergence in these l...

2012
Annette Rios Anne Göhring

This paper describes the process of constructing a trilingual parallel treebank. While for two of the involved languages, Spanish and German, there are already corpora with well-established annotation schemes available, this is not the case with the third language: Cuzco Quechua (ISO 639-3:quz), a low-resourced, non-standardized language for which we had to define a linguistically plausible ann...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید