8 search results - page 1 / 2 » Sparse Reliable Graph Backbones |
ICALP
2010
Springer
13 years 6 months ago
2010
Springer
Given a connected graph G and a failure probability pe for each edge e in G, the reliability of G is the probability that G remains connected when each edge e is removed independe...
BIBE
2007
IEEE
13 years 11 months ago
2007
IEEE
Abstract—This paper develops an algorithm for NMR backbone resonance assignment given a 3D structure and a set of relatively sparse 15 N-edited NMR data, with the through-space 1...
KDD
2008
ACM
14 years 5 months ago
2008
ACM
Social networks are of interest to researchers in part because they are thought to mediate the flow of information in communities and organizations. Here we study the temporal dyn...
ICASSP
2009
IEEE
13 years 8 months ago
2009
IEEE
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...
TCSV
2008
13 years 4 months ago
2008
Object tracking is one of the fundamental problems in computer vision and has received considerable attention in the past two decades. The success of a tracking algorithm relies on...