1092 search results - page 31 / 219 » Polynomial Interpretations and the Complexity of Algorithms |
ISSAC
2007
Springer
15 years 6 months ago
2007
Springer
In this paper we discuss the use of structured matrix methods for the numerical approximation of the zeros of a univariate polynomial. In particular, it is shown that root-findin...
118
click to vote
ACL
1990
15 years 28 days ago
1990
Referring expressions and other object descriptions should be maximal under the Local Brevity, No Unnecessary Components, and Lexical Preference preference rules; otherwise, they ...
ASPDAC
2007
ACM
15 years 3 months ago
2007
ACM
In the paper, we develop a systematic methodology for modeling sampled interconnect frequency response data based on spline interpolation. Through piecewise polynomial interpolatio...
101
Voted
ICANN
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The paper presents a new version of a GMDH type algorithm able to perform an automatic model structure synthesis, robust model parameter estimation and model validation i...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...