117 search results - page 4 / 24 » Query suggestion using hitting time |
HPDC
2003
IEEE
14 years 19 days ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
SIGIR
2008
ACM
13 years 5 months ago
2008
ACM
Results caching is an efficient technique for reducing the query processing load, hence it is commonly used in real search engines. This technique, however, bounds the maximum hit...
IIR
2010
13 years 8 months ago
2010
In this work we propose a comparative study of the effects of a continuous model update on the effectiveness of wellknown query recommendation algorithms. In their original formul...
SMI
2005
IEEE
14 years 28 days ago
2005
IEEE
For time-dependent scalar fields, one is often interested in topology changes of contours in time. In this paper, we focus on describing how contours split and merge over a certa...