This paper proposes new methods to answer approximate nearest neighbor queries on a set of n points in d-dimensional Euclidean space. For any xed constant d, a data structure with...
We consider here the problem of building a never-ending language learner; that is, an intelligent computer agent that runs forever and that each day must (1) extract, or read, inf...
Andrew Carlson, Justin Betteridge, Bryan Kisiel, B...
A common problem when using automated structure from motion techniques is that the object to be modelled can only be partially reconstructed from the video. This can occur because...
Anton van den Hengel, Anthony R. Dick, Thorsten Th...
An open issue in data-driven dependency parsing is how to handle non-projective dependencies, which seem to be required by linguistically adequate representations, but which pose ...
The development process of hypermedia applications implies very specific problems mainly related, first, to the use of navigational structures, interactive behaviours and multimed...