Sciweavers

492 search results - page 26 / 99
» Fast data stream algorithms using associative memories
Sort
View
MLDM
2005
Springer
14 years 1 months ago
Statistical Supports for Frequent Itemsets on Data Streams
Abstract. A statistical technique is developed for estimating the support of itemsets on data streams, regardless of the size of the data stored. This technique, which is computati...
Pierre-Alain Laur, Jean-Emile Symphor, Richard Noc...
ASPLOS
2011
ACM
12 years 11 months ago
Sponge: portable stream programming on graphics engines
Graphics processing units (GPUs) provide a low cost platform for accelerating high performance computations. The introduction of new programming languages, such as CUDA and OpenCL...
Amir Hormati, Mehrzad Samadi, Mark Woh, Trevor N. ...
MDM
2005
Springer
174views Communications» more  MDM 2005»
14 years 1 months ago
GPAC: generic and progressive processing of mobile queries over mobile data
This paper introduces a new family of Generic and Progressive algorithms (GPAC, for short) for continuous mobile queries over mobile objects. GPAC provides a general skeleton that...
Mohamed F. Mokbel, Walid G. Aref
ICDE
2008
IEEE
141views Database» more  ICDE 2008»
14 years 9 months ago
A General Framework for Fast Co-clustering on Large Datasets Using Matrix Decomposition
Abstract-- Simultaneously clustering columns and rows (coclustering) of large data matrix is an important problem with wide applications, such as document mining, microarray analys...
Feng Pan, Xiang Zhang, Wei Wang 0010
KDD
2003
ACM
194views Data Mining» more  KDD 2003»
14 years 8 months ago
Finding recent frequent itemsets adaptively over online data streams
A data stream is a massive unbounded sequence of data elements continuously generated at a rapid rate. Consequently, the knowledge embedded in a data stream is more likely to be c...
Joong Hyuk Chang, Won Suk Lee