21324 search results - page 484 / 4265 » Making the case for computing |
164
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
149
click to vote
CAGD
2007
15 years 7 months ago
2007
We present an algorithm which is able to compute all roots of a given univariate polynomial within a given interval. In each step, we use degree reduction to generate a strip boun...
117
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
We present and analyse a Monte-Carlo algorithm to compute the minimal polynomial of an n × n matrix over a finite field that requires O(n3 ) field operations and O(n) random v...
169
click to vote
PAMI
2006
15 years 7 months ago
2006
In an errors-in-variables (EIV) model, all the measurements are corrupted by noise. The class of EIV models with constraints separable into the product of two nonlinear functions, ...
155
click to vote
JCP
2007
15 years 7 months ago
2007
— Line spectral frequencies (LSF) and immittance spectral frequencies (ISF) are widely used in modern speech codecs based on autoregressive model. This paper addresses LSF and IS...