Sciweavers

2766 search results - page 19 / 554
» Algorithms for trigonometric polynomials
Sort
View
ADCM
2004
73views more  ADCM 2004»
13 years 8 months ago
Polynomial Reproduction in Subdivision
Abstract. We study conditions on the matrix mask of a vector subdivision scheme ensuring that certain polynomial input vectors yield polynomial output again. The conditions are in ...
Kurt Jetter, G. Zimmermann
TCS
1998
13 years 8 months ago
Dynamical Recognizers: Real-Time Language Recognition by Analog Computers
We consider a model of analog computation which can recognize various languages in real time. We encode an input word as a point in Rd by composing iterated maps, and then apply i...
Cristopher Moore
DAM
2006
100views more  DAM 2006»
13 years 8 months ago
On the colored Tutte polynomial of a graph of bounded treewidth
We observe that a formula given by S. Negami [Trans. Amer. Math. Soc. 299 (1987), 601-622] for the Tutte polynomial of a k-sum of two graphs generalizes to a colored Tutte polynom...
Lorenzo Traldi
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 8 months ago
Factoring Polynomials over Finite Fields using Balance Test
We study the problem of factoring univariate polynomials over finite fields. Under the assumption of the Extended Riemann Hypothesis (ERH), Gao [Gao01] designed a polynomial time ...
Chandan Saha
GEOINFORMATICA
1998
107views more  GEOINFORMATICA 1998»
13 years 8 months ago
A Comparison of Two Approaches to Ranking Algorithms Used to Compute Hill Slopes
The calculation of slope (downhill gradient) for a point in a digital elevation model (DEM) is a common procedure in the hydrological, environmental and remote sensing sciences. T...
Kevin H. Jones