Sciweavers

441 search results - page 47 / 89
» Query expansion using random walk models
Sort
View
MOBICOM
2009
ACM
14 years 4 months ago
Mobility increases the connectivity of K-hop clustered wireless networks
In this paper we investigate the connectivity for large-scale clustered wireless sensor and ad hoc networks. We study the effect of mobility on the critical transmission range fo...
Qingsi Wang, Xinbing Wang, Xiaojun Lin
TSP
2008
100views more  TSP 2008»
13 years 9 months ago
Geographic Gossip: Efficient Averaging for Sensor Networks
Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standa...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
NIPS
2008
13 years 11 months ago
Improved Moves for Truncated Convex Models
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
M. Pawan Kumar, Philip H. S. Torr
SIGIR
2003
ACM
14 years 3 months ago
Building a web thesaurus from web link structure
Thesaurus has been widely used in many applications, including information retrieval, natural language processing, and question answering. In this paper, we propose a novel approa...
Zheng Chen, Shengping Liu, Liu Wenyin, Geguang Pu,...
ML
2000
ACM
150views Machine Learning» more  ML 2000»
13 years 9 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew