Sciweavers

1211 search results - page 32 / 243
» Computing Manipulations of Ranking Systems
Sort
View
ICTIR
2009
Springer
13 years 5 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CIKM
2007
Springer
14 years 1 months ago
Effective top-k computation in retrieving structured documents with term-proximity support
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...
Mingjie Zhu, Shuming Shi, Mingjing Li, Ji-Rong Wen
LICS
2006
IEEE
14 years 1 months ago
On Typability for Rank-2 Intersection Types with Polymorphic Recursion
We show that typability for a natural form of polymorphic recursive typing for rank-2 intersection types is undecidable. Our proof involves characterizing typability as a context ...
Tachio Terauchi, Alex Aiken
CVPR
2004
IEEE
14 years 9 months ago
BoostMap: A Method for Efficient Approximate Similarity Rankings
This paper introduces BoostMap, a method that can significantly reduce retrieval time in image and video database systems that employ computationally expensive distance measures, ...
Vassilis Athitsos, Jonathan Alon, Stan Sclaroff, G...
GCC
2003
Springer
14 years 26 days ago
On the Malicious Participants Problem in Computational Grid
Abstract. Computational Grid allows customers to submit tasks to service providers. To maintain the availability, fairness and performance, it is critical to protect Computational ...
Wenguang Chen, Weimin Zheng, Guangwen Yang