نتایج جستجو برای: backward elimination procedure

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

2004
Glenn Gulak

The turbo-decoding algorithm can be viewed as a message passing procedure on a graph. We contrast the standard 6‘forward-backward’’ turbodecoding algorithm with a new “concurrent” algorithm that is suited to parallel implementation.

1999
Stephan Raaijmakers

Constructive induction transforms the representation of instances in order to produce a more accurate model of the concept to be learned. For this purpose, a variety of operators has been proposed in the literature, including a Cartesian product operator forming pairwise higher-order attributes. We study the effect of the Cartesian product operator on memory-based language learning, and demonst...

Rahimeh Hajinasiri, Saeid Afshari-sharifabad Saman Rezayati Sobhan Rezayati Zahra Erfani,

An efficient and simple procedure for the synthesis of 1,8-dioxo-octahydroxanthenes from the aromatic aldehydes and 5,5-dimethylcyclohexane-1,3-dione (dimedone) in the presence of boric acid [BO3H3 or B(OH)3] as an inexpensive and reusable catalyst is described. The salient features of this methodology are: the elimination of corrosive liquid acids, high yields, simple methodology, short reacti...

2015
Olga Morozova Olga Levina Anneli Uusküla Robert Heimer

BACKGROUND Automatic stepwise subset selection methods in linear regression often perform poorly, both in terms of variable selection and estimation of coefficients and standard errors, especially when number of independent variables is large and multicollinearity is present. Yet, stepwise algorithms remain the dominant method in medical and epidemiological research. METHODS Performance of st...

1999
David R. Mackay Kincho H. Law

This paper describes a parallel implementation of a generalized Lanczos procedure for structural dynamic analysis on a distributed memory parallel computer. One major cost of the generalized Lanczos procedure is the factorization of the (shifted) stiffness matrix and the forward and backward solution of triangular systems. In this paper, we discuss load assignment of a sparse matrix and propose...

2008
Yoshinori Tanabe Koichi Takahashi Masami Hagiya

The alternation-free fragment of the propositional modal μ-calculus (AFμ) allows less complex decision procedure for satisfiability judgment than the full μ-calculus, yet it still has strong expressive power. In this paper, we present a concrete decision procedure with its complexity for AFμ enriched by features of nominals, backward modalities, and functional modalities. While AFμ with all thr...

Rahimeh Hajinasiri, Saeid Afshari-sharifabad Saman Rezayati Sobhan Rezayati Zahra Erfani,

An efficient and simple procedure for the synthesis of 1,8-dioxo-octahydroxanthenes from the aromatic aldehydes and 5,5-dimethylcyclohexane-1,3-dione (dimedone) in the presence of boric acid [BO3H3 or B(OH)3] as an inexpensive and reusable catalyst is described. The salient features of this methodology are: the elimination of corrosive liquid acids, high yields, simple methodology, short reacti...

2003
J. A. Grzesik

Recent efforts by C.-T. Tai to emphasize backward scattering within the makeup of the optical theorem are examined here from first principles. The present work exploits spectral field representations and a common asymptotic procedure so as to build up both the scattered fields and their contribution to the extinction integral. The result of all this is to reaffirm the strictly forward scatterin...

2013
Alfred S Carasso

Identifying sources of ground water pollution, and deblurring nanoscale imagery as well as astronomical galaxy images, are two important applications involving numerical computation of parabolic equations backward in time. Surprisingly, very little is known about backward continuation in nonlinear parabolic equations. In this paper, an iterative procedure originating in spectroscopy in the 1930...

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

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