678 search results - page 49 / 136 » Structural Properties of Sparse Graphs |
127
click to vote
SDM
2009
SIAM
15 years 11 months ago
2009
SIAM
Mining graph data is an active research area. Several data mining methods and algorithms have been proposed to identify structures from graphs; still, the evaluation of those resu...
136
Voted
LICS
2010
IEEE
15 years 11 days ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...
136
click to vote
LATA
2009
Springer
15 years 9 months ago
2009
Springer
This tutorial will present an overview of the use of Monadic Second-Order Logic to describe sets of finite graphs and graph transformations, in relation with the notions of tree-w...
132
Voted
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
Kernel conditional random fields (KCRFs) are introduced as a framework for discriminative modeling of graph-structured data. A representer theorem for conditional graphical models...
334
Voted
ICA
2012
Springer
13 years 10 months ago
2012
Springer
A novel tensor decomposition called pattern or P-decomposition is proposed to make it possible to identify replicating structures in complex data, such as textures and patterns in ...