1552 search results - page 258 / 311 » On the Complexity of Constant Propagation |
EDBT
2008
ACM
15 years 12 months ago
2008
ACM
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
120
click to vote
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
In many emerging applications, data streams are monitored in a network environment. Due to limited communication bandwidth and other resource constraints, a critical and practical...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
As computing breaches petascale limits both in processor performance and storage capacity, the only way that current and future gains in performance can be achieved is by increasi...
TAMC
2007
Springer
15 years 6 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...
APLAS
2005
ACM
15 years 5 months ago
2005
ACM
This paper presents a novel method to construct a dynamic single assignment (DSA) form of array-intensive, pointer-free C programs (or in any other procedural language). A program ...