Sciweavers

598 search results - page 115 / 120
» A random graph model for massive graphs
Sort
View
SIGECOM
2005
ACM
117views ECommerce» more  SIGECOM 2005»
15 years 5 months ago
First-price path auctions
We study first-price auction mechanisms for auctioning flow between given nodes in a graph. A first-price auction is any auction in which links on winning paths are paid their ...
Nicole Immorlica, David R. Karger, Evdokia Nikolov...
BMCBI
2006
101views more  BMCBI 2006»
14 years 11 months ago
Hierarchical modularity of nested bow-ties in metabolic networks
Background: The exploration of the structural topology and the organizing principles of genomebased large-scale metabolic networks is essential for studying possible relations bet...
Jing Zhao, Hong Yu, Jianhua Luo, Zhi-Wei Cao, Yi-X...
CVPR
2012
IEEE
13 years 2 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»
14 years 11 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
GLOBECOM
2006
IEEE
15 years 5 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