7129 search results - page 1041 / 1426 » Approximation Algorithms for Treewidth |
123
click to vote
KDD
2006
ACM
16 years 4 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...
114
click to vote
KDD
2006
ACM
16 years 4 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...
140
click to vote
KDD
2005
ACM
16 years 4 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...
235
click to vote
VLDB
2007
ACM
16 years 4 months ago
2007
ACM
In this article, we propose a new approach for querying and indexing a database of trees with specific applications to XML datasets. Our approach relies on representing both the q...
133
click to vote
EDBT
2008
ACM
16 years 4 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...