961 search results - page 36 / 193 » Significance-Driven Graph Clustering |
122
Voted
IV
2009
IEEE
15 years 7 months ago
2009
IEEE
In this paper, we present an algorithm to lay out a particular class of graphs coming from real case studies: the quasi-tree graph class. Protein and internet mappings projects ha...
113
Voted
ICIP
2009
IEEE
14 years 10 months ago
2009
IEEE
In this paper, a new unsupervised hierarchical approach to textured color images segmentation is proposed. To this end, we have designed a two-step procedure based on a grey-scale...
127
click to vote
ISBI
2011
IEEE
14 years 4 months ago
2011
IEEE
High angular resolution diffusion imaging (HARDI) allows in vivo analysis of the white matter structure and connectivity. Based on orientation distribution functions (ODFs) that r...
100
Voted
GBRPR
2009
Springer
15 years 7 months ago
2009
Springer
We present an algorithm for graph matching in a pattern recognition context. This algorithm deals with weighted graphs, based on new structural and topological node signatures. Usi...
108
Voted
GD
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. Constrained graph layout is a recent generalisation of forcedirected graph layout which allows constraints on node placement. We give a constrained graph layout algorithm...