224 search results - page 13 / 45 » Homogeneous Decomposition of Polynomials |
CASES
2004
ACM
14 years 4 months ago
2004
ACM
Many optimization techniques, including several targeted specifically at embedded systems, depend on the ability to calculate the number of elements that satisfy certain conditio...
SWAT
2004
Springer
14 years 4 months ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
AAECC
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. In this paper we show that the separable decomposition of a univariate polynomial can be computed in softly optimal time, in terms of the number of arithmetic operations ...
CSDA
2010
13 years 11 months ago
2010
In this paper, we specify the indirect utility function as a partially linear model, where utility is nonparametric in expenditure and parametric (with fixed- or varying-coefficie...
ICA3PP
2005
Springer
14 years 4 months ago
2005
Springer
Abstract. In this paper, we evaluate message-passing applications in Grid environments using domain decomposition technique. We compare two domain decomposition strategies: a balan...