Sciweavers

108 search results - page 19 / 22
» Spreading of Messages in Random Graphs
Sort
View
INFOCOM
2002
IEEE
14 years 9 days ago
Using the Small-World Model to Improve Freenet Performance
– Efficient data retrieval in a peer-to-peer system like Freenet is a challenging problem. In this paper we study the impact of cache replacement policy on the performance of Fre...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
IPSN
2004
Springer
14 years 22 days ago
Naps: scalable, robust topology management in wireless ad hoc networks
Topology management schemes conserve energy in wireless ad hoc networks by identifying redundant nodes that may turn off their radios or other components while maintaining connec...
Brighten Godfrey, David Ratajczak
TMC
2008
127views more  TMC 2008»
13 years 7 months ago
Time and Energy Complexity of Distributed Computation of a Class of Functions in Wireless Sensor Networks
We consider a scenario in which a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing a...
Nilesh Khude, Anurag Kumar, Aditya Karnik
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
14 years 7 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
AAAI
2008
13 years 9 months ago
CIGAR: Concurrent and Interleaving Goal and Activity Recognition
In artificial intelligence and pervasive computing research, inferring users' high-level goals from activity sequences is an important task. A major challenge in goal recogni...
Derek Hao Hu, Qiang Yang