7215 search results - page 133 / 1443 » On the Consistency of Ranking Algorithms |
POPL
2003
ACM
14 years 8 months ago
2003
ACM
Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant int...
FLAIRS
2007
13 years 10 months ago
2007
We deal with the search process of the GraphPlan algorithm in this paper. We concentrate on a problem of finding supports for a sub-goal which arises during the search. We model t...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
COCO
2009
Springer
14 years 2 months ago
2009
Springer
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
ICTAI
2006
IEEE
14 years 2 months ago
2006
IEEE
Existing work shows that classic decision trees have inherent deficiencies in obtaining a good probability-based ranking (e.g. AUC). This paper aims to improve the ranking perfor...