125 search results - page 2 / 25 » Controllable and Progressive Edge Clustering for Large Netwo... |
PVLDB
2010
13 years 4 months ago
2010
The identification of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ...
AINA
2009
IEEE
14 years 27 days ago
2009
IEEE
—One of the main advantages of clustering algorithms is the ability to allow networks to be physically divided into smaller regions, thereby increasing the theoretical maximum nu...
ICC
2007
IEEE
14 years 12 days ago
2007
IEEE
—Although network-wide flooding in reactive routing protocols like AODV [1] facilitates the discovery of optimal routes, they engender large control overhead. Some efficient floo...
CGF
1998
13 years 5 months ago
1998
A multiresolution data decomposition offers a fundamental framework supporting compression, progressive transmission, and level-of-detail (LOD) control for large two or three dime...
EDBT
2012
ACM
11 years 8 months ago
2012
ACM
In this paper, we study how to find maximal k-edge-connected subgraphs from a large graph. k-edge-connected subgraphs can be used to capture closely related vertices, and findin...