43 search results - page 7 / 9 » Affinity rank: a new scheme for efficient web search |
CIKM
2007
Springer
15 years 5 months ago
2007
Springer
Modern web search engines are expected to return top-k results efficiently given a query. Although many dynamic index pruning strategies have been proposed for efficient top-k com...
IRI
2007
IEEE
15 years 6 months ago
2007
IEEE
Biomedical researchers rely on keyword-based search engines to retrieve superficially relevant documents, from which they must filter out irrelevant information manually. Hence, t...
117
click to vote
SIGMOD
2010
ACM
14 years 6 months ago
2010
ACM
We propose and study a new ranking problem in versioned databases. Consider a database of versioned objects which have different valid instances along a history (e.g., documents i...
130
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
Combating Web spam is one of the greatest challenges for Web search engines. State-of-the-art anti-spam techniques focus mainly on detecting varieties of spam strategies, such as ...
108
Voted
SIGIR
2008
ACM
14 years 11 months ago
2008
ACM
The classical probabilistic models attempt to capture the Ad hoc information retrieval problem within a rigorous probabilistic framework. It has long been recognized that the prim...