414 search results - page 17 / 83 » On discrete norms of polynomials |
COMPGEOM
2007
ACM
14 years 1 months ago
2007
ACM
In this paper we show that dimensionality reduction (i.e., Johnson-Lindenstrauss lemma) preserves not only the distances between static points, but also between moving points, and...
SIAMNUM
2010
13 years 4 months ago
2010
A set XN of N points on the unit sphere is a spherical t-design if the average value of any polynomial of degree at most t over XN is equal to the average value of the polynomial o...
ICLP
2005
Springer
14 years 3 months ago
2005
Springer
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm. In this paper, we show how to adapt ter...
ISSAC
2009
Springer
14 years 4 months ago
2009
Springer
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real coefficients. For a given pair of polynomials a...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
We consider the problem of approximating a set P of n points in Rd by a j-dimensional subspace under the p measure, in which we wish to minimize the sum of p distances from each p...