Sciweavers

5793 search results - page 271 / 1159
» Individual communication complexity
Sort
View
KDD
2009
ACM
216views Data Mining» more  KDD 2009»
16 years 7 months ago
Finding a team of experts in social networks
Given a task T , a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ,...
Theodoros Lappas, Kun Liu, Evimaria Terzi
PERCOM
2007
ACM
16 years 6 months ago
Buddy tracking - efficient proximity detection among mobile friends
: Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use ...
Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwa...
KIVS
2009
Springer
16 years 1 months ago
Providing Probabilistic Latency Bounds for Dynamic Publish/Subscribe Systems
In the context of large decentralized many-to-many communication systems it is impractical to provide realistic and hard bounds for certain QoS metrics including latency bounds. Ne...
M. Adnan Tariq, Boris Koldehofe, Gerald G. Koch, K...
GLOBECOM
2007
IEEE
16 years 1 months ago
A Frequency-Dependence Model for the Ultra-Wideband Channel Based on Propagation Events
— While the frequency-dependence of the wireless channel may be negligible for narrow to wideband signals, it has been shown that modeling this dependence for bandwidths in exces...
Camillo Gentile, Alfred Kik
ICCCN
2007
IEEE
16 years 1 months ago
Understanding Peer-level Performance in BitTorrent: A Measurement Study
—The observed performance by individual peers in BitTorrent can be simply measured by their average download rate. While it is often stated that the observed peer-level performan...
Amir H. Rasti, Reza Rejaie