145 search results - page 7 / 29 » Mining closed relational graphs with connectivity constraint... |
GISCIENCE
2008
Springer
15 years 21 days ago
2008
Springer
Topological relations are sometimes insufficient for differentiating spatial configurations of two objects with critical difference in their connection styles. In this paper, we pr...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
101
click to vote
SDM
2010
SIAM
15 years 1 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Given a contact network that changes over time (say, day vs night connectivity), and the SIS (susceptible/infected/susceptible, flu like) virus propagation model, what can we say ...
112
click to vote
GFKL
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...