Sciweavers

2996 search results - page 276 / 600
» Numberings and Randomness
Sort
View
KDD
2006
ACM
147views Data Mining» more  KDD 2006»
16 years 7 months ago
Summarizing itemset patterns using probabilistic models
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
Chao Wang, Srinivasan Parthasarathy
KDD
2003
ACM
150views Data Mining» more  KDD 2003»
16 years 7 months ago
Learning relational probability trees
Classification trees are widely used in the machine learning and data mining communities for modeling propositional data. Recent work has extended this basic paradigm to probabili...
Jennifer Neville, David Jensen, Lisa Friedland, Mi...
PODS
2004
ACM
143views Database» more  PODS 2004»
16 years 6 months ago
Approximate Counts and Quantiles over Sliding Windows
We consider the problem of maintaining approximate counts and quantiles over fixed- and variablesize sliding windows in limited space. For quantiles, we present deterministic algo...
Arvind Arasu, Gurmeet Singh Manku
MOBIHOC
2001
ACM
16 years 6 months ago
Effects of power conservation, wireless coverage and cooperation on data dissemination among mobile devices
This paper presents 7DS, a novel peer-to-peer data sharing system. 7DS is an architecture, a set of protocols and an implementation enabling the exchange of data among peers that ...
Maria Papadopouli, Henning Schulzrinne
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
16 years 4 months ago
On the Cell Probe Complexity of Dynamic Membership
We study the dynamic membership problem, one of the most fundamental data structure problems, in the cell probe model with an arbitrary cell size. We consider a cell probe model e...
KE YI, QIN ZHANG