151 search results - page 31 / 31 » Tight Bounds for Graph Problems in Insertion Streams |
SIGMOD
2010
ACM
13 years 10 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...