2922 search results - page 293 / 585 » On Relationships Between Query Models |
124
click to vote
SIGIR
2005
ACM
15 years 8 months ago
2005
ACM
When investigating alternative estimates for term discriminativeness, we discovered that relevance information and idf are much closer related than formulated in classical literat...
143
click to vote
SAC
2010
ACM
15 years 10 months ago
2010
ACM
While the trust paradigm is essential to broadly extend the communication between the environment’s actors, the evaluation of trust becomes a challenge when confronted with init...
121
click to vote
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
140
click to vote
SIGIR
2004
ACM
15 years 8 months ago
2004
ACM
Noun phrases in queries are identified and classified into four types: proper names, dictionary phrases, simple phrases and complex phrases. A document has a phrase if all content...
132
click to vote
IPM
2007
15 years 3 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...