Sciweavers

1469 search results - page 76 / 294
» Approximate polynomial decomposition
Sort
View
ISSAC
2005
Springer
119views Mathematics» more  ISSAC 2005»
15 years 3 months ago
Computing the multiplicity structure in solving polynomial systems
This paper presents a duality analysis and an algorithm for computing the multiplicity structure of a zero to a polynomial system, while the zero can be exact or approximate with ...
Barry H. Dayton, Zhonggang Zeng
FOCM
2007
48views more  FOCM 2007»
14 years 9 months ago
Integration and Optimization of Multivariate Polynomials by Restriction onto a Random Subspace
Abstract. We consider the problem of efficient integration of an n-variate polynomial with respect to the Gaussian measure in Rn and related problems of complex integration and opt...
Alexander I. Barvinok
NPL
1998
87views more  NPL 1998»
14 years 9 months ago
Constrained Learning in Neural Networks: Application to Stable Factorization of 2-D Polynomials
Adaptive artificial neural network techniques are introduced and applied to the factorization of 2-D second order polynomials. The proposed neural network is trained using a const...
Stavros J. Perantonis, Nikolaos Ampazis, Stavros V...
ICIP
2005
IEEE
15 years 11 months ago
Sampling schemes for 2-D signals with finite rate of innovation using kernels that reproduce polynomials
In this paper, we propose new sampling schemes for classes of 2-D signals with finite rate of innovation (FRI). In particular, we consider sets of 2-D Diracs and bilevel polygons....
Pancham Shukla, Pier Luigi Dragotti
VMV
2000
119views Visualization» more  VMV 2000»
14 years 11 months ago
Orientation Estimation Based on Weighted Projection onto Quadratic Polynomials
Essentially all Computer Vision strategies require initial computation of orientation structure or motion estimation. Although much work has been invested in this subfield, method...
Gunnar Farnebäck