893 search results - page 36 / 179 » Relational link-based ranking |
LICS
2006
IEEE
15 years 5 months ago
2006
IEEE
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 ...
107
click to vote
ESOP
2008
Springer
15 years 25 days ago
2008
Springer
Abstractions Aziem Chawdhary1 , Byron Cook2 , Sumit Gulwani2 , Mooly Sagiv3 , and Hongseok Yang1 1 Queen Mary, University of London 2 Microsoft Research 3 Tel Aviv University Abstr...
DEXAW
2010
IEEE
15 years 5 days ago
2010
IEEE
In many cases keywords from a restricted set of possible keywords have to be assigned to texts. A common way to find the best keywords is to rank terms occurring in the text accord...
ICTIR
2009
Springer
14 years 8 months ago
2009
Springer
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...
107
click to vote
PVLDB
2010
14 years 9 months ago
2010
We introduce the proximity rank join problem, where we are given a set of relations whose tuples are equipped with a score and a real-valued feature vector. Given a target feature...