نتایج جستجو برای: asymptotically pseudo

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

Journal: :Math. Comput. 1999
Peter Roelse

A C implementation of Niederreiter’s algorithm for factoring polynomials over F2 is described. The most time-consuming part of this algorithm, which consists of setting up and solving a certain system of linear equations, is performed in parallel. Once a basis for the solution space is found, all irreducible factors of the polynomial can be extracted by suitable gcdcomputations. For this purpos...

2001
Tong Zhang Keshab K. Parhi

A class of pseudo-random compound error-correcting codes, called Generalized Low-Density (GLD) Parity-Check codes, has been proposed recently. As a generalization of Gallager’s Low-Density ParityCheck (LDPC) codes, GLD codes are also asymptotically good in the sense of minimum distance criterion and can be effectively decoded based on iterative soft-input soft-output (SISO) decoding of individu...

1998
Jaouhar Ayadi Elisabeth de Carvalho Dirk T. M. Slock

We investigate Maximum Likelihood (ML) methods for blind and semi-blind estimation of multiple FIR channels. Two blind Deterministic ML (DML) strategies are presented. In the first one, we propose to modify the Iterative Quadratic ML (IQML) algorithm in order to ”denoise” it and hence obtain consistent channel estimates. The second strategy, called Pseudo-Quadratic ML (PQML), is naturally asymp...

1999
Farhad Shahrokhi Imrich Vrto

Let G = (V0; V1 ; V2; E) be a 3-layer graph. The 3-layer drawings of G in which V0 , V1 , and V2 are placed on 3 parallel lines and each edge in E is drawn using one straight line segment, are studied. A generalization of the linear arrangement problem which we call the 3-layer pseudo linear arrangement problem is introduced, and it is shown to be closely related to the 3-layer crossing number....

2010
Kevin Swersky

We explore the training and usage of the Restricted Boltzmann Machine for unsupervised feature extraction. We investigate the many different aspects involved in their training, and by applying the concept of iterate averaging we show that it is possible to greatly improve on state of the art algorithms. We also derive estimators based on the principles of pseudo-likelihood, ratio matching, and ...

2005
P. Sundell

We give a one-parameter family of exact solutions to 4D higher-spin gauge theory invariant under a deformed higher-spin extension of SO(3, 1) and parameterized by a zero-form invariant. All higher-spin gauge fields vanish, while the metric interpolates between two asymptotically AdS4 regions via two dS3-foliated domain walls and two H3-foliated Robertson-Walker spacetimes – one in the future an...

2001
Jiahua Chen Changbao Wu JIAHUA CHEN CHANGBAO WU

We use the model-calibrated pseudo empirical likelihood method to construct estimators for the finite population distribution function. Under an assumed superpopulation working model, the proposed estimators have minimum model expectation of asymptotic design-based variance among a class of estimators and therefore are optimal in that class. The estimators are asymptotically designunbiased irre...

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

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