Sciweavers

203 search results - page 22 / 41
» On interpolation by radial polynomials
Sort
View
ISSAC
2009
Springer
269views Mathematics» more  ISSAC 2009»
14 years 3 months ago
On factorization of multivariate polynomials over algebraic number and function fields
We present an efficient algorithm for factoring a multivariate polynomial f ∈ L[x1, . . . , xv] where L is an algebraic function field with k ≥ 0 parameters t1, . . . , tk an...
Seyed Mohammad Mahdi Javadi, Michael B. Monagan
AINA
2007
IEEE
14 years 3 months ago
Reducing the Complexity in the Distributed Multiplication Protocol of Two Polynomially Shared Values
The multiparty multiplication of two polynomially shared values over Zq with a public prime number q is an important module in distributed computations. The multiplication protoco...
Peter Lory
TIT
2010
98views Education» more  TIT 2010»
13 years 3 months ago
QR decomposition of Laurent polynomial matrices sampled on the unit circle
Abstract--We consider Laurent polynomial (LP) matrices defined on the unit circle of the complex plane. QR decomposition of an LP matrix A(s) yields QR factors Q(s) and R(s) that, ...
Davide Cescato, Helmut Bölcskei
ICMCS
2006
IEEE
159views Multimedia» more  ICMCS 2006»
14 years 2 months ago
Image Vector Quantization Indices Recovery using Lagrange Interpolation
Vector quantization (VQ) is an efficient coding algorithm due to its fast decoding efficiency. Indices of VQ will be lost during the transmission because of the signal interferenc...
Yung-Gi Wu, Chia-Hao Wu
IJCNN
2007
IEEE
14 years 3 months ago
Upper Bound on Pattern Storage in Feedforward Networks
—Starting from the strict interpolation equations for multivariate polynomials, an upper bound is developed for the number of patterns that can be memorized by a nonlinear feedfo...
Pramod Lakshmi Narasimha, Michael T. Manry, Franci...