280 search results - page 14 / 56 » New Algorithms for Enumerating All Maximal Cliques |
FIMI
2004
14 years 11 months ago
2004
In this paper, we present an ongoing work to discover maximal frequent itemsets in a transactional database. We propose an algorithm called ABS for Adaptive Borders Search, which ...
JPDC
2007
14 years 9 months ago
2007
High quality of security is increasingly critical for applications running on heterogeneous distributed systems. However, existing scheduling algorithms for heterogeneous distribu...
107
click to vote
KDD
2010
ACM
15 years 1 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
SIGIR
2002
ACM
14 years 9 months ago
2002
ACM
We present a novel sequential clustering algorithm which is motivated by the Information Bottleneck (IB) method. In contrast to the agglomerative IB algorithm, the new sequential ...
CVPR
2003
IEEE
15 years 11 months ago
2003
IEEE
We introduce a new classification algorithm based on the concept of Symmetric Maximized Minimal distance in Subspace (SMMS). Given the training data of authentic samples and impos...