198
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The problem of learning the structure of Bayesian networks from complete discrete data with a limit on parent set size is considered. Learning is cast explicitly as an optimisatio...
240
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
We study the problem of learning high dimensional regression models regularized by a structured-sparsity-inducing penalty that encodes prior structural information on either input...
192
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
As the number of computing devices embedded into engineered systems continues to rise, there is a widening gap between the needs of the user to control aggregates of devices and t...
206
click to vote
CORR
2012
Springer
14 years 2 months ago
2012
Springer
The notions of subgraph centrality and communicability, based on the exponential of the adjacency matrix of the underlying graph, have been effectively used in the analysis of und...