Sciweavers

6245 search results - page 121 / 1249
» A Case for Aggregate Networks
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 4 months ago
Constant-factor approximation algorithms for identifying dynamic communities
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
Chayant Tantipathananandh, Tanya Y. Berger-Wolf
INFOCOM
2002
IEEE
15 years 8 months ago
On the capacity of wireless networks: The relay case
Abstract— In [1], Gupta and Kumar determined the capacity of wireless networks under certain assumptions, among them point-to-point coding, which excludes for example multi-acces...
Michael Gastpar, Martin Vetterli
IPTPS
2004
Springer
15 years 9 months ago
The Case for a Hybrid P2P Search Infrastructure
Popular P2P file-sharing systems like Gnutella and Kazaa use unstructured network designs. These networks typically adopt flooding-based search techniques to locate files. Whil...
Boon Thau Loo, Ryan Huebsch, Ion Stoica, Joseph M....
GIS
2008
ACM
16 years 5 months ago
Using tomography for ubiquitous sensing
By embedding sensors in mobile devices, it is possible to exploit the ubiquitous presence of these devices to construct applications for large-scale sensing and monitoring of envi...
Stacy Patterson, Bassam Bamieh, Amr El Abbadi
INFOCOM
2009
IEEE
15 years 10 months ago
A Case for Decomposition of FIFO Networks
—Recent findings showing that the output of traffic flows at packet switches has similar characteristics as the corresponding input enable a decomposition analysis of a networ...
Florin Ciucu, Jörg Liebeherr