1127 search results - page 146 / 226 » Testing the Expansion of a Graph |
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
WSDM
2010
ACM
15 years 7 months ago
2010
ACM
Recently, there has been tremendous interest in the phenomenon of influence propagation in social networks. The studies in this area assume they have as input to their problems a ...
CSE
2009
IEEE
15 years 4 months ago
2009
IEEE
Abstract—Collaborative or “Social” filtering has been successfully deployed over the years as a technique for analysing large amounts of user-preference knowledge to predict...
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
CIBCB
2007
IEEE
15 years 4 months ago
2007
IEEE
—Many dynamical processes can be represented as directed attributed graphs or Petri nets where relationships between various entities are explicitly expressed. Signaling networks...