Sciweavers

9520 search results - page 1505 / 1904
» is 2011
Sort
View
INFOCOM
2011
IEEE
14 years 11 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...
INFOCOM
2011
IEEE
14 years 11 months ago
Optimal multicast capacity and delay tradeoffs in MANETs: A global perspective
—In this paper, we give a global perspective of multicast capacity and delay analysis in Mobile Ad-hoc Networks (MANETs). Specifically, we consider two node mobility models: (1)...
Yun Wang, Xiaoyu Chu, Xinbing Wang, Yu Cheng
INFOCOM
2011
IEEE
14 years 11 months ago
Dissemination in opportunistic mobile ad-hoc networks: The power of the crowd
—Opportunistic ad-hoc communication enables portable devices such as smartphones to effectively exchange information, taking advantage of their mobility and locality. The nature ...
Gjergji Zyba, Geoffrey M. Voelker, Stratis Ioannid...
INFOCOM
2011
IEEE
14 years 11 months ago
The digital rights management game in peer-to-peer streaming systems
—In this paper we model the digital rights management (DRM) for peer-to-peer streaming (P2PS) systems as a game. We construct the DRM game from both content service provider (CSP...
Jin Zhang, Wei Lou
INFOCOM
2011
IEEE
14 years 11 months ago
SocialFilter: Introducing social trust to collaborative spam mitigation
—We propose SocialFilter, a trust-aware collaborative spam mitigation system. Our proposal enables nodes with no email classification functionality to query the network on wheth...
Michael Sirivianos, Kyungbaek Kim, Xiaowei Yang
« Prev « First page 1505 / 1904 Last » Next »