2681 search results - page 88 / 537 » Problem F |
CORR
2009
Springer
13 years 8 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
SWAT
1994
Springer
14 years 2 months ago
1994
Springer
A graph is distance-hereditary if and only if each cycle on five or more vertices has at least two crossing chords. We present linear time algorithms for the minimum r-dominating c...
MCS
2006
Springer
13 years 10 months ago
2006
Springer
8 The training of some types of neural networks leads to separable non-linear least squares problems. These problems may be9 ill-conditioned and require special techniques. A robus...
SIAMIS
2010
13 years 4 months ago
2010
Image restoration problems are often converted into large-scale, nonsmooth and nonconvex optimization problems. Most existing minimization methods are not efficient for solving su...
SIAMMAX
2010
13 years 4 months ago
2010
We propose practical stopping criteria for the iterative solution of sparse linear least squares (LS) problems. Although we focus our discussion on the algorithm LSQR of Paige and ...