4009 search results - page 190 / 802 » Clustering on Complex Graphs |
161
click to vote
AAAI
2010
15 years 5 months ago
2010
Gaussian Mixture Model (GMM) is one of the most popular data clustering methods which can be viewed as a linear combination of different Gaussian components. In GMM, each cluster ...
130
click to vote
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We present sublinear-time (randomized) algorithms for finding simple cycles of length at least k 3 and tree-minors in bounded-degree graphs. The complexity of these algorithms is...
132
click to vote
PVLDB
2010
15 years 2 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
135
click to vote
BMVC
2010
15 years 2 months ago
2010
The Texture Fragmentation and Reconstruction (TFR) algorithm has been recently introduced [9] to address the problem of image segmentation by textural properties, based on a suita...
120
click to vote
INFOVIS
2003
IEEE
15 years 9 months ago
2003
IEEE
Graph and tree visualization techniques enable interactive exploration of complex relations while communicating topology. However, most existing techniques have not been designed ...