Sciweavers

285 search results - page 7 / 57
» Characterization of the Existence of Galled-Tree Networks
Sort
View
INFOCOM
2012
IEEE
13 years 2 months ago
Sampling directed graphs with random walks
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
Bruno F. Ribeiro, Pinghui Wang, Fabricio Murai, Do...
MOBIHOC
2010
ACM
14 years 9 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
102
Voted
MONET
2007
126views more  MONET 2007»
14 years 11 months ago
Performance Evaluation of a Power Management Scheme for Disruption Tolerant Network
Disruption Tolerant Network (DTN) is characterized by frequent partitions and intermittent connectivity. Power management issue in such networks is challenging. Existing power man...
Yong Xi, Mooi Choo Chuah, K. Chang
CISS
2008
IEEE
15 years 6 months ago
Game theory for heterogeneous flow control
—A general framework is developed for networks with flows that use all available congestion signals to regulate their rates. It is conceptually a generalization of the existing ...
Ao Tang, Lachlan L. H. Andrew
KDD
2010
ACM
318views Data Mining» more  KDD 2010»
14 years 10 months ago
DivRank: the interplay of prestige and diversity in information networks
Information networks are widely used to characterize the relationships between data items such as text documents. Many important retrieval and mining tasks rely on ranking the dat...
Qiaozhu Mei, Jian Guo, Dragomir R. Radev