1722 search results - page 80 / 345 » On the sample mean of graphs |
127
click to vote
EJC
2007
15 years 17 days ago
2007
We construct algorithms for deciding essentially any minor-closed parameter, with explicit time bounds. This result strengthens previous results by Robertson and Seymour [1,2], Fr...
121
Voted
JMLR
2012
13 years 3 months ago
2012
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
101
Voted
VLDB
2004
ACM
15 years 6 months ago
2004
ACM
Large boolean matrices are a basic representational unit in a variety of applications, with some notable examples being interactive visualization systems, mining large graph struc...
114
Voted
CORR
2004
Springer
15 years 13 days ago
2004
Springer
We define the concept of dependence among multiple variables using maximum entropy techniques and introduce a graphical notation to denote the dependencies. Direct inference of in...
112
Voted
GCSE
2001
Springer
15 years 5 months ago
2001
Springer
Architecture conception is a difficult and time consuming process, requiring advanced skills from the software architect. The tasks of an architect are alleviated if means can be p...