We intentionally use the highest level of scaling here in these calculations to demonstrate the upper bound on the required external memory throughput.
Thus, given a constant number of rounds and a bound on the bandwidth per round, we have implicitly assured that memory and CPU consumption of the bounded set reconciliation is also (O k + (m - mathcal {L}))).
In order to use the Apriori algorithm in the disease prediction setting, Buczak et al. [ 21] had to set a relatively low upper bound on the size of the frequent sets due to computer memory constraints.
As discussed in our previous work (Conway and Bromage, 2011), information theory gives a lower bound for the memory usage.
To cope with the inherent memory limitations of online systems and to embed tracking capabilities to the design, an upper bound on the dimension of the linear subspaces is imposed.
Think of that as the upper bound on the price.
A bound on the direction (d_{k}).
A bound on the steps (s_{k}).
Moreover, we discuss how we can provide an upper bound on the value of the optimal coalition structure, and we show that for specific characteristic functions we can provide such bounds while maintaining polynomial computational costs and memory requirements.
One should be aware however, that more memory is required for a higher number of seeds in order to store more hash tables and this enforces an upper bound on the number of seeds that can be used.
