4009 search results - page 64 / 802 » Clustering on Complex Graphs |
102
click to vote
MICAI
2007
Springer
15 years 6 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
DAC
2000
ACM
16 years 24 days ago
2000
ACM
132
click to vote
ICWSM
2009
14 years 9 months ago
2009
Gephi is an open source software for graph and network analysis. It uses a 3D render engine to display large networks in real-time and to speed up the exploration. A flexible and ...
106
click to vote
SSDBM
2010
IEEE
14 years 9 months ago
2010
IEEE
Graphs are prevailingly used in many applications to model complex data structures. In this paper, we study the problem of supergraph containment search. To avoid the NP-complete s...
109
click to vote
CVPR
2003
IEEE
16 years 1 months ago
2003
IEEE
Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often...