232 search results - page 14 / 47 » Dynamic Graph Clustering Using Minimum-Cut Trees |
ESA
2004
Springer
15 years 5 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
130
click to vote
TDSC
2010
14 years 10 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...
101
click to vote
KDD
2009
ACM
16 years 6 days 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...
123
click to vote
AI
2010
Springer
14 years 11 months ago
2010
Springer
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
120
click to vote
BMCBI
2010
14 years 11 months ago
2010
Background: Many bioinformatics analyses, ranging from gene clustering to phylogenetics, produce hierarchical trees as their main result. These are used to represent the relations...