28 search results - page 2 / 6 » Computing f(A)b via Least Squares Polynomial Approximations |
137
click to vote
MICS
2007
15 years 7 days ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
110
Voted
JSC
2008
15 years 20 days ago
2008
We describe the design, implementation and experimental evaluation of new algorithms for computing the approximate factorization of multivariate polynomials with complex coefficie...
89
Voted
TSP
2008
15 years 18 days ago
2008
In this correspondence, parameter estimation of a polynomial phase signal (PPS) in additive white Gaussian noise is addressed. Assuming that the order of the PPS is at least 3, the...
102
Voted
DIALM
2008
ACM
15 years 2 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...
128
click to vote
CG
2004
Springer
15 years 17 days ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...