Results 31 to 40 of about 2,465,255 (121)
, 1999 The paper presents a two-level learning method for radial basis function (RBF) networks. A regularized orthogonal least squares (ROLS) algorithm is employed at the lower level to construct RBF networks while the two key learning parameters, the ...
Luk, B.L., Wu, Y., Chen, S.
core +1 more source
Robust nonlinear model identification methods using forward regression
, 2003 In this correspondence new robust nonlinear model construction algorithms for a large class of linear-in-the-parameters models are introduced to enhance model robustness via combined parameter regularization and new robust structural selective criteria ...
Hong, X. +3 more
core +2 more sources
Prairie Squares Records, 1962-2000; Crescent Squares Records, 1968-1982 [PDF]
, 2019 The Prairie Squares and Crescent Squares Records consist of instructional square dancing manuals and pamphlets, movement guides, historical magazines, local histories of North Dakota square dance clubs, meeting minutes, guest books, by laws ...
Prairie Squares, Crescent Squares
core
Quasi-complete Latin squares: construction and randomization
, 1984 A general method for constructing quasi-complete Latin squares based on groups is given. This method leads to a relatively straightforward way of counting the number of inequivalent quasi-complete Latin squares of side at most 9.
Bailey, Rosemary Anne +2 more
core +1 more source
On Graph-Orthogonal Arrays by Mutually Orthogonal Graph Squares
, 2020 During the last two centuries, after the question asked by Euler concerning mutually orthogonal Latin squares (MOLS), essential advances have been made. MOLS are considered as a construction tool for orthogonal arrays.
M. S. Mohamed, A. El-Mesady, M. Higazy
core +1 more source
A class of latin squares derived from finite abelian groups [PDF]
, 2011 summary:We consider two classes of latin squares that are prolongations of Cayley tables of finite abelian groups. We will show that all squares in the first of these classes are confirmed bachelor squares, squares that have no orthogonal mate and ...
Evans, Anthony B. +6 more
core +1 more source
Three mutually orthogonal Latin squares [PDF]
, 1972 In a famous paper [3], Bose, Shrikhande, and Parker proved the existence of a pair of orthogonal Latin squares of order v for all v ≠ 2,6. In the present paper it is shown that there exist three mutually orthogonal Latin squares for all v ≡ 0,1 (mod 4 ...
Mills, W.H
core +1 more source
Multiplexed quantitative neuropeptidomics via DiLeu isobaric tagging. [PDF]
Methods Enzymol, 2022 Sauer CS, Li L.
europepmc +1 more source
Versatile non-luminescent color palette based on guest exchange dynamics in paramagnetic cavitands. [PDF]
Nat Commun, 2021 Goren E, Avram L, Bar-Shir A.
europepmc +1 more source
On the difference between orthogonal matching pursuit and orthogonal least squares
, 2007 — Greedy algorithms are often used to solve underdetermined inverse problems when the solution is constrained to be sparse, i.e. the solution is only expected to have a relatively small number of non-zero elements.
Blumensath, T. +3 more
core