333 search results - page 12 / 67 » Labels from Reductions: Towards a General Theory |
155
click to vote
LICS
2007
IEEE
16 years 9 days 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...
224
click to vote
SIGIR
2012
ACM
13 years 8 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...
186
click to vote
ICFP
2003
ACM
16 years 6 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...
185
click to vote
SIGIR
2009
ACM
16 years 16 days 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...
169
click to vote
RTA
2009
Springer
16 years 17 days 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...