492 search results - page 31 / 99 » Fast data stream algorithms using associative memories |
ESA
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Data sets in large applications are often too massive to t completely inside the computer's internal memory. The resulting input output communication or I O between ...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Some applications have to present their results in the form of ranked lists. This is the case of many information retrieval applications, in which documents must be sorted accordi...
SDM
2003
SIAM
13 years 9 months ago
2003
SIAM
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
IDA
2008
Springer
13 years 7 months ago
2008
Springer
We study the problem of finding frequent items in a continuous stream of itemsets. A new frequency measure is introduced, based on a flexible window length. For a given item, its ...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Memory trace analysis is an important technology for architecture research, system software (i.e., OS, compiler) optimization, and application performance improvements. Many appro...