— We present an analytic and geometric view of the sample mean of graphs. The theoretical framework yields efficient subgradient methods for approximating a structural mean and ...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
: Access management for learning communities requires a unified theory, sustaining the implementation of instructional policies, for `social networks'. The management method w...
An estimation of the generalization performance of classifier is one of most important problems in pattern clasification and neural network training theory. In this paper we estima...
Ontological modelling for machine inference has featured prominently in IT management research recently, but there is more immediate scope for knowledge modelling in the realm of h...