750 search results - page 78 / 150 » Reconstruction for Models on Random Graphs |
140
click to vote
CVPR
2009
IEEE
15 years 10 months ago
2009
IEEE
Many vision problems have been formulated as en- ergy minimization problems and there have been signif- icant advances in energy minimization algorithms. The most widely-used energ...
105
click to vote
TSP
2008
14 years 11 months ago
2008
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
ICASSP
2008
IEEE
15 years 6 months ago
2008
IEEE
The emerging theory of compressed sensing (CS) provides a universal signal detection approach for sparse signals at sub-Nyquist sampling rates. A small number of random projection...
108
click to vote
JMLR
2010
14 years 6 months ago
2010
An algorithm is presented for topology selection in graphical models of autoregressive Gaussian time series. The graph topology of the model represents the sparsity pattern of the...
TOMS
2010
14 years 10 months ago
2010
The Tutte polynomial of a graph, also known as the partition function of the q-state Potts model, is a 2-variable polynomial graph invariant of considerable importance in both comb...