2040 search results - page 133 / 408 » On the Complexity of Error Explanation |
AUTOMATICA
2004
13 years 9 months ago
2004
An algorithm for the construction of an explicit piecewise linear state feedback approximation to nonlinear constrained receding horizon control is given. It allows such controlle...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
: Described are two algorithms to find long approximate palindromes in a string, for example a DNA sequence. A simple algorithm requires O(n)space and almost always runs in O(k.n)-...
MOC
1998
13 years 9 months ago
1998
Rutishauser, Gragg and Harrod and finally H.Y. Zha used the same class of chasing algorithms for transforming arrowhead matrices to tridiagonal form. Using a graphical theoretical...
JCIT
2010
13 years 4 months ago
2010
In 2008, Wang et. al. first investigate a sort of specific secure multi-party computation--secure convex hull two-party computation, and construct two protocols based on Gift wrap...
ICASSP
2011
IEEE
13 years 1 months ago
2011
IEEE
It is well known that the affine projection algorithm (APA) offers a good tradeoff between convergence rate/tracking and computational complexity. Recently, the evolutionary APA (...