3 search results - page 1 / 1 » Fast and Faster: A Comparison of Two Streamed Matrix Decompo... |
CORR
2011
Springer
12 years 12 months ago
2011
Springer
With the explosion of the size of digital dataset, the limiting factor for decomposition algorithms is the number of passes over the input, as the input is often stored out-of-cor...
SIGIR
2009
ACM
13 years 11 months ago
2009
ACM
With the sheer growth of online user data, it becomes challenging to develop preference learning algorithms that are sufficiently flexible in modeling but also affordable in com...
SIGMOD
2010
ACM
13 years 9 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...