26 search results - page 3 / 6 » Coarse-Grained Topology Estimation via Graph Sampling |
CAS
2008
13 years 5 months ago
2008
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
ICCV
2007
IEEE
14 years 7 months ago
2007
IEEE
Object tracking is viewed as a two-class 'one-versusrest' classification problem, in which the sample distribution of the target is approximately Gaussian while the back...
SPAA
2005
ACM
13 years 11 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
CIMCA
2005
IEEE
13 years 11 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
JMLR
2012
11 years 7 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...