288 search results - page 3 / 58 » Document generality: its computation for ranking |
SIGMOD
2011
ACM
14 years 11 days ago
2011
ACM
We study the problem of context-sensitive ranking for document retrieval, where a context is defined as a sub-collection of documents, and is specified by queries provided by do...
ADHOCNOW
2004
Springer
15 years 3 months ago
2004
Springer
We address the question of finding sensors’ coordinates, or at least an approximation of them, when the sensors’ abilities are very weak. In a d dimensional space, we define ...
CIKM
2007
Springer
15 years 3 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...
101
click to vote
CIKM
2008
Springer
14 years 11 months ago
2008
Springer
Although PageRank has been designed to estimate the popularity of Web pages, it is a general algorithm that can be applied to the analysis of other graphs other than one of hypert...
COLING
2010
14 years 4 months ago
2010
This paper presents a comparative study on two key problems existing in extractive summarization: the ranking problem and the selection problem. To this end, we presented a system...