1040 search results - page 66 / 208 » TCAM-conscious Algorithms for Data Streams |
EGH
2009
Springer
13 years 8 months ago
2009
Springer
Stream compaction is a common parallel primitive used to remove unwanted elements in sparse data. This allows highly parallel algorithms to maintain performance over several proce...
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Very large databases are required to store massive amounts of data that are continuously inserted and queried. Analyzing huge data sets and extracting valuable pattern in many appl...
PAKDD
2007
ACM
14 years 4 months ago
2007
ACM
Catching the recent trend of data is an important issue when mining frequent itemsets from data streams. To prevent from storing the whole transaction data within the sliding windo...
DAWAK
2006
Springer
14 years 1 months ago
2006
Springer
Recently, the data stream, which is an unbounded sequence of data elements generated at a rapid rate, provides a dynamic environment for collecting data sources. It is likely that ...
KDD
2006
ACM
14 years 10 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...