1469 search results - page 12 / 294 » Approximate polynomial decomposition |
ICML
2005
IEEE
15 years 10 months ago
2005
IEEE
Low-rank matrix decompositions are essential tools in the application of kernel methods to large-scale learning problems. These decompositions have generally been treated as black...
COMPGEOM
2004
ACM
15 years 3 months ago
2004
ACM
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
In this paper, the result of applying iterative univariate resultant constructions to multivariate polynomials is analyzed. We consider the input polynomials as generic polynomials...
AAECC
2004
Springer
14 years 9 months ago
2004
Springer
Abstract. This article describes two algorithms in order to search decomposition groups of ideals of polynomials with coefficients in a perfect field when those ideals are generate...
JUCS
2006
14 years 9 months ago
2006
: A sequence of increasing translation invariant subspaces can be defined by the Haar-system (or generally by wavelets). The orthogonal projection to the subspaces generates a deco...