10608 search results - page 591 / 2122 » Complexity of O'Hara's Algorithm |
222
click to vote
DATE
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper describes new algorithms for systemlevel software synthesis, namely the scheduling and allocation of a set of complex tasks running at multiple rates on a heterogeneous...
182
click to vote
DAWAK
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. In this paper, we present a fast algorithm to answer rangesum queries in OLAP data cubes. Our algorithm supports constanttime queries while maintaining sub-linear time up...
168
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
We define external memory (or I/O) models which capture space complexity and develop a general technique for deriving I/O-space trade-offs in these models from internal memory mode...
162
click to vote
ESOP
2008
Springer
15 years 9 months ago
2008
Springer
We present a polynomial-time algorithm which at the extra cost of a factor O(k) (k the number of variables) generalizes inter-procedural copy constant propagation. Our algorithm in...
194
click to vote
DICTA
2008
15 years 8 months ago
2008
Although trivial background subtraction algorithms (such as temporal averaging) can execute quite quickly, they do not give useful results in most situations. More complex algorit...