507 search results - page 24 / 102 » Computing Sparse Multiples of Polynomials |
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
FOCS
1992
IEEE
13 years 11 months ago
1992
IEEE
We consider a variant of the traditional task of explicitly reconstructing algebraic functions from black box representations. In the traditional setting for such problems, one is ...
TCS
2008
13 years 7 months ago
2008
Formalized study of self-assembly has led to the definition of the tile assembly model, Previously I presented ways to compute arithmetic functions, such as addition and multiplic...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In this paper we derive aggregate separation bounds, named after Davenport-MahlerMignotte (DMM), on the isolated roots of polynomial systems, specifically on the minimum distance ...
IJCNN
2008
IEEE
14 years 2 months ago
2008
IEEE
— A novel sparse kernel density estimator is derived based on a regression approach, which selects a very small subset of significant kernels by means of the D-optimality experi...