804 search results - page 137 / 161 » Experiments on Union-Find Algorithms for the Disjoint-Set Da... |
153
Voted
CIKM
2010
Springer
15 years 2 months ago
2010
Springer
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
145
Voted
ICDM
2003
IEEE
15 years 9 months ago
2003
IEEE
Clustering is an important technique for understanding and analysis of large multi-dimensional datasets in many scientific applications. Most of clustering research to date has be...
162
Voted
BMCBI
2004
15 years 3 months ago
2004
Background: To identify differentially expressed genes, it is standard practice to test a twosample hypothesis for each gene with a proper adjustment for multiple testing. Such te...
137
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
189
Voted
KDD
2008
ACM
16 years 4 months ago
2008
ACM
A multi-mode network typically consists of multiple heterogeneous social actors among which various types of interactions could occur. Identifying communities in a multi-mode netw...