Sciweavers

1321 search results - page 157 / 265
» Quadratic forms on graphs
Sort
View
JMLR
2012
12 years 18 days ago
Exact Covariance Thresholding into Connected Components for Large-Scale Graphical Lasso
We consider the sparse inverse covariance regularization problem or graphical lasso with regularization parameter λ. Suppose the sample covariance graph formed by thresholding th...
Rahul Mazumder, Trevor Hastie
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 10 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
FOCS
2009
IEEE
14 years 4 months ago
The Complexity of Rationalizing Network Formation
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...
Shankar Kalyanaraman, Christopher Umans
ECCV
2006
Springer
15 years 1 days ago
Efficient Belief Propagation with Learned Higher-Order Markov Random Fields
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...
Xiangyang Lan, Stefan Roth, Daniel P. Huttenlocher...
WWW
2008
ACM
14 years 10 months ago
IRLbot: scaling to 6 billion pages and beyond
This paper shares our experience in designing a web crawler that can download billions of pages using a single-server implementation and models its performance. We show that with ...
Hsin-Tsang Lee, Derek Leonard, Xiaoming Wang, Dmit...