1469 search results - page 14 / 294 » Approximate polynomial decomposition |
70
Voted
WSC
2008
14 years 12 months ago
2008
Mathematical models are often described by multivariate functions, which are usually approximated by a sum of lower dimensional functions. A major problem is the approximation err...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
In this paper, we propose a new shape decomposition method, called convex shape decomposition. We formalize the convex decomposition problem as an integer linear programming probl...
78
Voted
ICDM
2005
IEEE
15 years 3 months ago
2005
IEEE
The most suitable method for the automated classification of protein structures remains an open problem in computational biology. In order to classify a protein structure with an...
FCT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. It is proved that everywhere-dense Min 2SAT and everywheredense Min Eq both have polynomial time approximation schemes.
MP
2010
14 years 8 months ago
2010
In this paper, we consider approximation algorithms for optimizing a generic multi-variate homogeneous polynomial function, subject to homogeneous quadratic constraints. Such opti...