621 search results - page 50 / 125 » Learning to Distribute Queries into Web Search Nodes |
84
Voted
ESORICS
2005
Springer
15 years 6 months ago
2005
Springer
Distributed Hash Tables (DHTs) are very efficient distributed systems for routing, but at the same time vulnerable to disruptive nodes. Designers of such systems want them used in ...
108
Voted
SIGIR
2010
ACM
15 years 4 months ago
2010
ACM
Ranking search results is a fundamental problem in information retrieval. In this paper we explore whether the use of proximity and phrase information can improve web retrieval ac...
121
Voted
SIGCOMM
2003
ACM
15 years 5 months ago
2003
ACM
Content-based full-text search is a challenging problem in Peer-toPeer (P2P) systems. Traditional approaches have either been centralized or use flooding to ensure accuracy of th...
122
Voted
ICML
2008
IEEE
16 years 1 months ago
2008
IEEE
In this paper we investigate two aspects of ranking problems on large graphs. First, we augment the deterministic pruning algorithm in Sarkar and Moore (2007) with sampling techni...
127
Voted
WWW
2006
ACM
16 years 1 months ago
2006
ACM
Understanding goals and preferences behind a user's online activities can greatly help information providers, such as search engine and E-Commerce web sites, to personalize c...