Sciweavers

5785 search results - page 1052 / 1157
» Approximability of Probability Distributions
Sort
View
225
Voted
ICDT
2009
ACM
147views Database» more  ICDT 2009»
16 years 4 months ago
The average-case complexity of counting distinct elements
We continue the study of approximating the number of distinct elements in a data stream of length n to within a (1? ) factor. It is known that if the stream may consist of arbitra...
David P. Woodruff
CHI
2009
ACM
16 years 4 months ago
Feed me: motivating newcomer contribution in social network sites
Social networking sites (SNS) are only as good as the content their users share. Therefore, designers of SNS seek to improve the overall user experience by encouraging members to ...
Moira Burke, Cameron Marlow, Thomas M. Lento
232
Voted
PODS
2009
ACM
134views Database» more  PODS 2009»
16 years 4 months ago
An efficient rigorous approach for identifying statistically significant frequent itemsets
As advances in technology allow for the collection, storage, and analysis of vast amounts of data, the task of screening and assessing the significance of discovered patterns is b...
Adam Kirsch, Michael Mitzenmacher, Andrea Pietraca...
170
Voted
KDD
2003
ACM
191views Data Mining» more  KDD 2003»
16 years 4 months ago
Assessment and pruning of hierarchical model based clustering
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
229
Voted
SIGMOD
2008
ACM
191views Database» more  SIGMOD 2008»
16 years 3 months ago
Efficient aggregation for graph summarization
Graphs are widely used to model real world objects and their relationships, and large graph datasets are common in many application domains. To understand the underlying character...
Yuanyuan Tian, Richard A. Hankins, Jignesh M. Pate...
« Prev « First page 1052 / 1157 Last » Next »