115 search results - page 7 / 23 » Scalable Discovery of Best Clusters on Large Graphs |
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
IWPC
2000
IEEE
13 years 12 months ago
2000
IEEE
Call graphs are commonly used as input for automatic clustering algorithms, the goal of which is to extract the high level structure of the program under study. Determining the ca...
ICC
2008
IEEE
14 years 1 months ago
2008
IEEE
—For a large-scale mesh network with dynamic traffic, maintaining the global state information in a centralized fashion is impractical. Hence, distributed schemes are needed to ...
BMCBI
2010
13 years 7 months ago
2010
Background: Ab initio protein structure prediction methods generate numerous structural candidates, which are referred to as decoys. The decoy with the most number of neighbors of...
SDM
2010
SIAM
13 years 9 months ago
2010
SIAM
We introduce a novel Bayesian framework for hybrid community discovery in graphs. Our framework, HCDF (short for Hybrid Community Discovery Framework), can effectively incorporate...