333 search results - page 12 / 67 » Labels from Reductions: Towards a General Theory |
91
Voted
LICS
2007
IEEE
15 years 6 months ago
2007
IEEE
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
137
click to vote
SIGIR
2012
ACM
13 years 2 months ago
2012
ACM
In this paper, we propose a novel top-k learning to rank framework, which involves labeling strategy, ranking model and evaluation measure. The motivation comes from the difficul...
107
Voted
ICFP
2003
ACM
15 years 11 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
106
Voted
SIGIR
2009
ACM
15 years 6 months ago
2009
ACM
When search is against structured documents, it is beneficial to extract information from user queries in a format that is consistent with the backend data structure. As one step...
101
Voted
RTA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. β-reduction. Traditional presentations...