37 search results - page 7 / 8 » Discovering Large Dense Subgraphs in Massive Graphs |
PAKDD
2010
ACM
14 years 9 days ago
2010
ACM
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
ICDM
2009
IEEE
14 years 2 months ago
2009
IEEE
—Identifying modules, or natural communities, in large complex networks is fundamental in many fields, including social sciences, biological sciences and engineering. Recently s...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Given a real, and weighted person-to-person network which changes over time, what can we say about the cliques that it contains? Do the incidents of communication, or weights on t...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...