4009 search results - page 150 / 802 » Clustering on Complex Graphs |
144
click to vote
APWEB
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
153
click to vote
EDBT
2012
ACM
13 years 6 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...
127
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
This paper presents an approach for modeling landmark sites such as the Statue of Liberty based on large-scale contaminated image collections gathered from the Internet. Our system...
142
Voted
MICCAI
2010
Springer
15 years 2 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
138
Voted
IEEEPACT
2002
IEEE
15 years 8 months ago
2002
IEEE
This paper presents a new modulo scheduling algorithm for clustered microarchitectures. The main feature of the proposed scheme is that the assignment of instructions to clusters ...