1552 search results - page 170 / 311 » On the Complexity of Constant Propagation |
163
click to vote
IPPS
1997
IEEE
15 years 10 months ago
1997
IEEE
Given an n-degree polynomial f x over an arbitrary ring, the shift of f x by c is the operation which computes coefficients of the polynomial f x + c . In this paper we conside...
153
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
A fundamental building block of many data mining and analysis approaches is density estimation as it provides a comprehensive statistical model of a data distribution. For that re...
189
click to vote
DCOSS
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
147
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
The complexity exhibited by pervasive systems is constantly increasing. Customer electronics devices provide day to day a larger amount of functionalities. A common approach for g...
172
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...