Sciweavers

1736 search results - page 332 / 348
» On antimagic directed graphs
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
14 years 12 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
128
Voted
CGF
2010
168views more  CGF 2010»
14 years 12 months ago
Modeling Complex Unfoliaged Trees from a Sparse Set of Images
We present a novel image-based technique for modeling complex unfoliaged trees. Existing tree modeling tools either require capturing a large number of views for dense 3D reconstr...
Luis D. Lopez, Yuanyuan Ding, Jingyi Yu
CORR
2010
Springer
210views Education» more  CORR 2010»
14 years 12 months ago
Exploiting Statistical Dependencies in Sparse Representations for Signal Recovery
Signal modeling lies at the core of numerous signal and image processing applications. A recent approach that has drawn considerable attention is sparse representation modeling, in...
Tomer Faktor, Yonina C. Eldar, Michael Elad
CORR
2010
Springer
177views Education» more  CORR 2010»
14 years 12 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
105
Voted
CORR
2008
Springer
150views Education» more  CORR 2008»
14 years 11 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky