Sciweavers

598 search results - page 118 / 120
» A random graph model for massive graphs
Sort
View
INFOCOM
2006
IEEE
15 years 5 months ago
Designing Low Cost Networks with Short Routes and Low Congestion
— We design network topologies and routing strategies which optimize several measures simultaneously: low cost, small routing diameter , bounded degree and low congestion. This s...
Van Nguyen, Charles U. Martel
CORR
2010
Springer
182views Education» more  CORR 2010»
14 years 11 months ago
Fast Convergence of Natural Bargaining Dynamics in Exchange Networks
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
Yashodhan Kanoria, Mohsen Bayati, Christian Borgs,...
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
14 years 11 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot
ICDE
2007
IEEE
175views Database» more  ICDE 2007»
16 years 1 months ago
Dynamic Batch Nearest Neighbor Search in Video Retrieval
To retrieve similar database videos to a query clip, each video is typically represented by a sequence of highdimensional feature vectors. Given a query video containing m feature...
Jie Shao, Zi Huang, Heng Tao Shen, Xiaofang Zhou, ...
119
Voted
EDBT
2010
ACM
246views Database» more  EDBT 2010»
15 years 6 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...