Sciweavers

745 search results - page 84 / 149
» On Generating Random Network Structures: Connected Graphs
Sort
View
80
Voted
INFOCOM
2008
IEEE
15 years 7 months ago
Approximation Algorithms for Computing Capacity of Wireless Networks with SINR Constraints
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...
Deepti Chafekar, V. S. Anil Kumar, Madhav V. Marat...
142
Voted
COMSWARE
2008
IEEE
15 years 2 months ago
Extracting dense communities from telecom call graphs
Social networks refer to structures made of nodes that represent people or other entities embedded in a social context, and whose edges represent interaction between entities. Typi...
Vinayaka Pandit, Natwar Modani, Sougata Mukherjea,...
TIT
2010
146views Education» more  TIT 2010»
14 years 7 months ago
Information propagation speed in mobile and delay tolerant networks
Abstract--The goal of this paper is to increase our understanding of the fundamental performance limits of mobile and Delay Tolerant Networks (DTNs), where end-to-end multi-hop pat...
Philippe Jacquet, Bernard Mans, Georgios Rodolakis
112
Voted
ICDM
2009
IEEE
164views Data Mining» more  ICDM 2009»
15 years 7 months ago
iTopicModel: Information Network-Integrated Topic Modeling
—Document networks, i.e., networks associated with text information, are becoming increasingly popular due to the ubiquity of Web documents, blogs, and various kinds of online da...
Yizhou Sun, Jiawei Han, Jing Gao, Yintao Yu
MOBIHOC
2008
ACM
16 years 6 days ago
Using persistent homology to recover spatial information from encounter traces
In order to better understand human and animal mobility and its potential effects on Mobile Ad-Hoc networks and Delay-Tolerant Networks, many researchers have conducted experiment...
Brenton D. Walker