We present a study we conducted to build a repository storing associations between simple dependency treelets in a source language and their corresponding phrases in a target lang...
We present a new window-based method for correspondence search using varying support-weights. We adjust the support-weights of the pixels in a given support window based on color s...
We investigate to what extent people making relevance judgements for a reusable IR test collection are exchangeable. We consider three classes of judge: "gold standard" ...
Peter Bailey, Nick Craswell, Ian Soboroff, Paul Th...
We prove the strongest known bound for the risk of hypotheses selected from the ensemble generated by running a learning algorithm incrementally on the training data. Our result i...
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length to computations on tapes of arbitrary ordinal length. We show that a ...