5128 search results - page 876 / 1026 » An Efficient Storage Manager |
132
click to vote
WWW
2001
ACM
16 years 7 months ago
2001
ACM
Many emerging web and Internet applications are based on a group communications model. Thus, securing group communications is an important Internet design issue. The key graph app...
172
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...
157
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
162
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...
195
click to vote
KDD
2006
ACM
16 years 7 months ago
2006
ACM
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...