820 search results - page 67 / 164 » Inducing Temporal Graphs |
ICDM
2006
IEEE
15 years 6 months ago
2006
IEEE
How to effectively protect against spam on search ranking results is an important issue for contemporary web search engines. This paper addresses the problem of combating one majo...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
103
click to vote
KDD
1995
ACM
15 years 3 months ago
1995
ACM
One objective of knowledge acquisition using inductive modeling has been the development of correct and effectively computable descriptions that can also be assimilated and used b...
SIAMDM
2002
14 years 11 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
113
click to vote
JMLR
2012
13 years 2 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...