6045 search results - page 380 / 1209 » Computable Linearizations of Well-partial-orderings |
158
click to vote
IJON
1998
15 years 7 months ago
1998
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...
128
click to vote
JCISD
2002
15 years 7 months ago
2002
High performance liquid chromatography (HPLC) with ultraviolet (UV) spectrophotometric detection is a common method for analyzing reaction products in organic chemistry. This proc...
225
click to vote
NN
2002
Springer
2002
Springer
Optimal design of regularization term and regularization parameter by subspace information criterion
15 years 7 months ago
The problem of designing the regularization term and regularization parameter for linear regression models is discussed. Previously, we derived an approximation to the generalizat...
190
click to vote
PAAPP
2002
15 years 7 months ago
2002
Applications involving large sparse nonsymmetric linear systems encourage parallel implementations of robust iterative solution methods, such as GMRES(k). Two parallel versions of...
221
click to vote
ECCC
2010
15 years 6 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...