223 search results - page 22 / 45 » Approximate Frequency Counts over Data Streams |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
182
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Data stream applications have made use of statistical summaries to reason about the data using nonparametric tools such as histograms, heavy hitters, and join sizes. However, rela...
185
click to vote
SIGMOD
2006
ACM
15 years 9 months ago
2006
ACM
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
70
Voted
TCS
2008
14 years 9 months ago
2008
Computing frequent itemsets is one of the most prominent problems in data mining. We study the following related problem, called FREQSAT, in depth: given some itemset-interval pai...
ICCAD
2001
IEEE
15 years 6 months ago
2001
IEEE
As system integration evolves and tighter design constraints must be met, it becomes necessary to account for the non-ideal behavior of all the elements in a system. Certain devic...