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

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

2009
PIERRE ALBIN RICHARD MELROSE

The ‘Folk Theorem’ that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a ‘resolution tower’ which projects to a resolution, with iterated boundary fibration, of the quotient. Equivaria...

2001
Joseph Newton Christopher F. Baum Nicholas J. Cox Joanne M. Garrett Marcello Pagano Patrick Royston

Editor Associate Editors H. Joseph Newton Christopher F. Baum, Boston College Department of Statistics Nicholas J. Cox, University of Durham Texas A & M University Joanne M. Garrett, University of North Carolina College Station, Texas 77843 Marcello Pagano, Harvard School of Public Health 979-845-3142 J. Patrick Royston, UK Medical Research Council 979-845-3142 Jeroen Weesie, Utrecht University...

2002
James F. Davis Wolfgang Lück

We introduce a new spectral sequence called the p-chain spectral sequence which converges to the (co-)homology of a contravariant C-space with coefficients in a covariant C-spectrum for a small category C. It is different from the corresponding Atiyah-Hirzebruch type spectral sequence. It can be used in combination with the Isomorphism Conjectures of Baum-Connes and Farrell-Jones to compute alg...

2004
JAMES F. DAVIS WOLFGANG LÜCK

We introduce a new spectral sequence called the p-chain spectral sequence which converges to the (co-)homology of a contravariant C-space with coefficients in a covariant C-spectrum for a small category C. It is different from the corresponding Atiyah–Hirzebruch-type spectral sequence. It can be used in combination with the Isomorphism Conjectures of Baum and Connes and Farrell and Jones to com...

2006
CHRISTIAN VOIGT

In this paper we construct a bivariant Chern character for the equivariant KK-theory of a totally disconnected group with values in bivariant equivariant cohomology in the sense of Baum and Schneider. We prove in particular that the complexified left hand side of the Baum-Connes conjecture for a totally disconnected group is isomorphic to cosheaf homology. Moreover, it is shown that our transfo...

Journal: :Periodica Mathematica Hungarica 2003
Alexander R. Pruss

Abstract. Let X1, X2, . . . be a sequence of independent and identically distributed random variables, and put Sn = X1 + · · ·+ Xn. Under some conditions on the positive sequence τn and the positive increasing sequence an, we give necessary and sufficient conditions for the convergence of ∑ ∞ n=1 τnP (|Sn| ≥ εan) for all ε > 0, generalizing Baum and Katz’s (1965) generalization of the Hsu-Robbi...

2003
HEATH EMERSON

For a large class of word hyperbolic groups Γ the cross product C∗-algebras C(∂Γ)⋊Γ, where ∂Γ denotes the Gromov boundary of Γ satisfy Poincaré duality in K-theory. This class strictly contains fundamental groups of compact, negatively curved manifolds. We discuss the general notion of Poincaré duality for C∗-algebras, construct the fundamental classes for the aforementioned algebras, and prove...

Journal: :Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing 1996
T Yada M Ishikawa H Tanaka K Asai

We have developed a method to extract the signal patterns in DNA sequences. In this method, the Genetic Algorithm (GA) and Baum-Welch algorithm are used to obtain the best Hidden Markov Model (HMM) representations of the signal patterns in DNA sequences. The GA is used to search the best network shapes and the initial parameters of the HMMs. Baum-Welch algorithm is used to optimize the HMM para...

2010
Roger Hsiao Alan Black Florian Metze

In speech recognition, discriminative training has proved to be an effective method to improve recognition accuracy. It has successfully improved systems of different scales and different languages. While discriminative training has been developing for over 20 years, it continues to draw attention to researchers and remains to be one of the most important topics in speech recognition to date. D...

2011
Debashis Chakraborty

In this paper, we have proposed a new concept of text compression/decompression algorithm using special character replacement technique. Moreover after the initial compression after replacement of special characters, we remove the spaces between the words in the intermediary compressed file in specific situations to get the final compressed text file. Experimental results show that the proposed...

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

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