1469 search results - page 63 / 294 » Approximate polynomial decomposition |
168
click to vote
ICDE
2008
IEEE
15 years 11 months ago
2008
IEEE
Abstract-- A decomposition of a binary matrix into two matrices gives a set of basis vectors and their appropriate combination to form the original matrix. Such decomposition solut...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
XCSF is the extension of XCS in which classifier prediction is computed as a linear combination of classifier inputs and a weight vector associated to each classifier. XCSF can...
AMC
2007
14 years 10 months ago
2007
In the implementation of subdivision scheme, three of the most important issues are smoothness, size of support, and approximation order. Our objective is to introduce an improved...
EWC
2007
14 years 9 months ago
2007
In numerous instances, accurate algorithms for approximating the original geometry is required. One typical example is a circle involute curve which represents the underlying geom...
COCO
2009
Springer
15 years 4 months ago
2009
Springer
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...