7150 search results - page 1059 / 1430 » An Approximation Algorithm for Approximation Rank |
176
click to vote
KDD
2008
ACM
16 years 7 months ago
2008
ACM
We introduce the problem of query decomposition, where we are given a query and a document retrieval system, and we want to produce a small set of queries whose union of resulting...
171
click to vote
KDD
2006
ACM
16 years 7 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...
159
click to vote
KDD
2006
ACM
16 years 7 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...
188
click to vote
KDD
2005
ACM
16 years 7 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...
282
Voted
VLDB
2007
ACM
16 years 7 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...