10988 search results - page 172 / 2198 » Algorithmic Folding Complexity |
152
Voted
CIAC
2010
Springer
15 years 7 days ago
2010
Springer
We study the parameterized complexity of the problems of determining whether a graph contains a k-edge subgraph (k-vertex induced subgraph) that is a -graph for -graphs being one ...
112
click to vote
KDD
2006
ACM
16 years 3 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...
141
click to vote
IPPS
2008
IEEE
15 years 10 months ago
2008
IEEE
Graph structure can model the relationships among a set of objects. Mining quasi-clique patterns from large dense graph data makes sense with respect to both statistic and applica...
114
click to vote
SMC
2007
IEEE
15 years 9 months ago
2007
IEEE
— The basic objective of this work is to assess the utility of two supervised learning algorithms AdaBoost and RIPPER for classifying SSH traffic from log files without using f...
148
click to vote
VLDB
2007
ACM
15 years 9 months ago
2007
ACM
Multi-core processors are proliferated across different domains in recent years. In this paper, we study the performance of frequent pattern mining on a modern multi-core machine....