A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions specified as Ra...
This paper investigates the combination of word-alignments computed with the competitive linking algorithm and well-established IBM models. New training methods for phrase-based st...
Taking the temporal dimension into account in searching, i.e., using time of content creation as part of the search condition, is now gaining increasingly interest. However, in the...
This paper explores how a ‘learning’ algorithm can be added to UGV’s by giving it the ability to test the terrain through ‘feeling’ using incorporated sensors, which woul...
Siddharth Odedra, Stephen D. Prior, Mehmet Karaman...
It seems obvious that a successful model of natural language would incorporate a great deal of both linguistic and world knowledge. Interestingly, state of the art language models...
Eric Brill, Radu Florian, John C. Henderson, Lidia...