3875 search results - page 701 / 775 » Approximation Algorithms for the Max-coloring Problem |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
EDBT
2008
ACM
14 years 7 months ago
2008
ACM
Estimating the number of distinct elements in a large multiset has several applications, and hence has attracted active research in the past two decades. Several sampling and sket...
SODA
2010
ACM
14 years 5 months ago
2010
ACM
We settle the 1-pass space complexity of (1 ? )approximating the Lp norm, for real p with 1 p 2, of a length-n vector updated in a length-m stream with updates to its coordinate...