Sciweavers

712 search results - page 137 / 143
» A mixture model for random graphs
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
A learning-based framework for depth ordering
Depth ordering is instrumental for understanding the 3D geometry of an image. We as humans are surprisingly good ordering even with abstract 2D line drawings. In this paper we pro...
Zhaoyin Jia, Andrew C. Gallagher, Yao-Jen Chang, T...
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 8 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
BMCBI
2010
82views more  BMCBI 2010»
13 years 7 months ago
Predicting the network of substrate-enzyme-product triads by combining compound similarity and functional domain composition
Background: Metabolic pathway is a highly regulated network consisting of many metabolic reactions involving substrates, enzymes, and products, where substrates can be transformed...
Lei Chen, Kai-Yan Feng, Yu-Dong Cai, Kuo-Chen Chou...
GLOBECOM
2006
IEEE
14 years 1 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang