507 search results - page 71 / 102 » Computing Sparse Multiples of Polynomials |
CVPR
2003
IEEE
14 years 9 months ago
2003
IEEE
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We consider a fundamental problem in computational learning theory: learning an arbitrary Boolean function which depends on an unknown set of k out of n Boolean variables. We give...
ESA
2001
Springer
14 years 7 days ago
2001
Springer
Real algebraic expressions are expressions whose leaves are integers and whose internal nodes are additions, subtractions, multiplications, divisions, k-th root operations for int...
ASAP
2000
IEEE
14 years 4 days ago
2000
IEEE
This paper presents an e cient hardware algorithm for variable-precision logarithm. The algorithm uses an iterative te chnique that employs table lookups and polynomial approximat...
ANTS
2010
Springer
13 years 11 months ago
2010
Springer
Lattices over number elds arise from a variety of sources in algorithmic algebra and more recently cryptography. Similar to the classical case of Z-lattices, the choice of a nice,...