37 search results - page 5 / 8 » Discovering Large Dense Subgraphs in Massive Graphs |
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
CVPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate how to discover all common visual patterns within two sets of feature points. Common visual patterns generally share similar local features as well as similar spati...
ICPP
2000
IEEE
13 years 12 months ago
2000
IEEE
Clustering is a data mining problem which finds dense regions in a sparse multi-dimensional data set. The attribute values and ranges of these regions characterize the clusters. ...
CN
2010
13 years 7 months ago
2010
We consider massively dense ad hoc networks and study their continuum limits as the node density increases and as the graph providing the available routes becomes a continuous area...