492 search results - page 10 / 99 » Fast data stream algorithms using associative memories |
FTTCS
2006
13 years 7 months ago
2006
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast ...
PAKDD
2005
ACM
14 years 1 months ago
2005
ACM
We study the problem of mining frequent value sets from a large sensor network. We discuss how sensor stream data could be represented that facilitates efficient online mining and ...
IEEEPACT
2008
IEEE
14 years 2 months ago
2008
IEEE
The memory access limits the performance of stream processors. By exploiting the reuse of data held in the Stream Register File (SRF), an on-chip storage, the number of memory acc...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
—This paper deals with the traditional IP address lookup problem with fast updates. We propose a B-tree data structure, called MMSPT (Multiway Most Specific Prefix Tree), which i...
ACIIDS
2009
IEEE
14 years 21 days ago
2009
IEEE
— We consider the problem of processing exact results for sliding window joins over data streams with limited memory. Existing approaches deal with memory limitations by shedding...