Sciweavers

7751 search results - page 1176 / 1551
» Data streams: algorithms and applications
Sort
View
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
16 years 1 months ago
Cartesian contour: a concise representation for a collection of frequent sets
In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this sche...
Ruoming Jin, Yang Xiang, Lin Liu
SSDBM
2008
IEEE
107views Database» more  SSDBM 2008»
16 years 1 months ago
ProUD: Probabilistic Ranking in Uncertain Databases
There are a lot of application domains, e.g. sensor databases, traffic management or recognition systems, where objects have to be compared based on vague and uncertain data. Feat...
Thomas Bernecker, Hans-Peter Kriegel, Matthias Ren...
TIME
2008
IEEE
16 years 1 months ago
Time Aware Mining of Itemsets
Frequent behavioural pattern mining is a very important topic of knowledge discovery, intended to extract correlations between items recorded in large databases or Web acces logs....
Bashar Saleh, Florent Masseglia
IPPS
2007
IEEE
16 years 1 months ago
Programming Distributed Memory Sytems Using OpenMP
OpenMP has emerged as an important model and language extension for shared-memory parallel programming. On shared-memory platforms, OpenMP offers an intuitive, incremental approac...
Ayon Basumallik, Seung-Jai Min, Rudolf Eigenmann
B
2007
Springer
16 years 1 months ago
Symmetry Reduction for B by Permutation Flooding
Symmetry reduction is an established method for limiting the amount of states that have to be checked during exhaustive model checking. The idea is to only verify a single represen...
Michael Leuschel, Michael J. Butler, Corinna Sperm...
« Prev « First page 1176 / 1551 Last » Next »