3105 search results - page 297 / 621 » The Path-Packing Structure of Graphs |
187
Voted
ICTAI
2008
IEEE
15 years 11 months ago
2008
IEEE
Frequent patterns in program executions represent recurring sequences of events. These patterns can be used to reveal the hidden structures of a program, and ease the comprehensio...
125
click to vote
ICDM
2006
IEEE
15 years 10 months ago
2006
IEEE
This work presents a systematic comparison between seven kernels (or similarity matrices) on a graph, namely the exponential diffusion kernel, the Laplacian diffusion kernel, the ...
130
click to vote
ICMCS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a robust and efficient skeleton-based graph matching method for object recognition and recovery applications. The novel feature is to unify both object recogni...
156
click to vote
WEA
2010
Springer
15 years 9 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...
129
Voted
COMPGEOM
2010
ACM
15 years 9 months ago
2010
ACM
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...