Sciweavers

598 search results - page 65 / 120
» A random graph model for massive graphs
Sort
View
AI
1998
Springer
14 years 11 months ago
Utility-Based On-Line Exploration for Repeated Navigation in an Embedded Graph
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
Shlomo Argamon-Engelson, Sarit Kraus, Sigalit Sina
INFOCOM
2008
IEEE
15 years 6 months ago
Modeling the Evolution of Degree Correlation in Scale-Free Topology Generators
—In this paper, we examine the asymptotic behavior of degree correlation (i.e., the joint degree distribution of adjacent nodes) in several scale-free topology generators GED [13...
Xiaoming Wang, Xiliang Liu, Dmitri Loguinov
INFOCOM
2007
IEEE
15 years 6 months ago
Modelling and Optimization of Stochastic Routing for Wireless Multi-Hop Networks
—We introduce a novel approach to multi-hop routing in wireless networks. Instead of the usual graph description we characterize the network by the packet delivery ratio matrix w...
Alejandro Ribeiro, Georgios B. Giannakis, Zhi-Quan...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 6 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer
TON
2008
106views more  TON 2008»
14 years 11 months ago
On static and dynamic partitioning behavior of large-scale P2P networks
Abstract--In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node fail...
Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri...