Sciweavers

1368 search results - page 38 / 274
» Generalized Rook Polynomials
Sort
View
FOCS
2004
IEEE
14 years 2 months ago
Testing Low-Degree Polynomials over Prime Fields
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
Charanjit S. Jutla, Anindya C. Patthak, Atri Rudra...
MA
2010
Springer
150views Communications» more  MA 2010»
13 years 5 months ago
Cokriging for spatial functional data
This work proposes to generalize the method of cokriging when data are spatially sampled curves. A spatial functional linear model is constructed including spatial dependencies be...
David Nerini, Pascal Monestiez, Claude Manté...
STOC
2005
ACM
158views Algorithms» more  STOC 2005»
14 years 11 months ago
Polynomial time quantum algorithm for the computation of the unit group of a number field
We present a quantum algorithm for the computation of the irrational period lattice of a function on Zn which is periodic in a relaxed sense. This algorithm is applied to compute t...
Arthur Schmidt, Ulrich Vollmer
ISSAC
2007
Springer
94views Mathematics» more  ISSAC 2007»
14 years 5 months ago
Faster algorithms for the characteristic polynomial
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
Clément Pernet, Arne Storjohann
CVPR
2010
IEEE
14 years 4 months ago
Polynomial Shape from Shading
We examine the shape from shading problem without boundary conditions as a polynomial system. This view allows, in generic cases, a complete solution for ideal polyhedral objects....
Ady Ecker, Allan Jepson