368 search results - page 36 / 74 » Higher Eigenvalues of Graphs |
136
click to vote
APWEB
2005
Springer
15 years 8 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...
144
click to vote
ICIP
2010
IEEE
15 years 1 months ago
2010
IEEE
A novel multiregion graph cut image partitioning method combined with kernel mapping is presented. A kernel function transforms implicitly the image data into data of a higher dim...
266
click to vote
CSL
2011
Springer
14 years 10 months ago
2011
Springer
How much can we infer about the pronunciation of a language – past or present – by observing which words its speakers rhyme? This paper explores the connection between pronunc...
138
Voted
CVPR
2004
IEEE
16 years 5 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
137
Voted
WEA
2010
Springer
15 years 8 months ago
2010
Springer
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. As contemporary networks are not static but e...